5606 search results - page 549 / 1122 » Randomization Techniques for Graphs. |
203
click to vote
PDCAT
2005
Springer
16 years 20 days ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
205
click to vote
INFOCOM
2003
IEEE
16 years 14 days ago
2003
IEEE
— A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are curren...
221
click to vote
SAC
2003
ACM
16 years 13 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
189
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
247
click to vote
JCB
2002
15 years 6 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...