745 search results - page 20 / 149 » On Generating Random Network Structures: Connected Graphs |
111
click to vote
COMPLEX
2009
Springer
15 years 4 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
SODA
1996
ACM
15 years 1 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
104
Voted
ADHOCNOW
2004
Springer
15 years 5 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
103
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
The testing of the performance of opportunistic communication protocols and applications is usually done through simulation as i) deployments are expensive and should be left to t...
145
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...