745 search results - page 21 / 149 » On Generating Random Network Structures: Connected Graphs |
168
Voted
ESA
2007
Springer
15 years 9 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
220
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
126
click to vote
DCC
2001
IEEE
16 years 2 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
108
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
145
click to vote
TROB
2008
15 years 2 months ago
2008
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...