Sciweavers

745 search results - page 21 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 6 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
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...
Laurent Flindt Muller, Martin Zachariasen
185
Voted
CP
2009
Springer
16 years 1 months ago
On the Structure of Industrial SAT Instances
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...
Carlos Ansótegui, Jordi Levy, Maria Luisa B...
101
Voted
DCC
2001
IEEE
16 years 1 days ago
Towards Compressing Web Graphs
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...
Micah Adler, Michael Mitzenmacher
ICC
2008
IEEE
127views Communications» more  ICC 2008»
15 years 7 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—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 ...
Fei Xing, Wenye Wang
117
Voted
TROB
2008
159views more  TROB 2008»
15 years 10 days ago
Distributed Connectivity Control of Mobile Networks
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...
Michael M. Zavlanos, George J. Pappas