1591 search results - page 30 / 319 » Random lifts of graphs |
104
Voted
DCC
2001
IEEE
16 years 10 days 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...
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
158
click to vote
COLOGNETWENTE
2010
14 years 11 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
165
click to vote
COMSUR
2011
14 years 17 days ago
2011
Abstract—The computational and memory resources of wireless sensor nodes are typically very limited, as the employed low-energy microcontrollers provide only hardware support for...
109
Voted
CAAN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...