Sciweavers

723 search results - page 120 / 145
» On the hyperbolicity constant in graphs
Sort
View
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
16 years 7 days ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
EUROPAR
2007
Springer
16 years 7 days ago
On the Connectivity of Bluetooth-Based Ad Hoc Networks
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracapr...
HPCC
2007
Springer
16 years 7 days ago
CDACAN: A Scalable Structured P2P Network Based on Continuous Discrete Approach and CAN
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
Lingwei Li, Qunwei Xue, Deke Guo
MFCS
2007
Springer
16 years 6 days ago
On Approximation of Bookmark Assignments
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hir...
WAW
2007
Springer
91views Algorithms» more  WAW 2007»
16 years 5 days ago
Determining Factors Behind the PageRank Log-Log Plot
Abstract. We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relat...
Yana Volkovich, Nelly Litvak, Debora Donato