You have Guest access.
Log In
Ittai Abraham, Dahlia Malkhi and Gurmeet Singh Manku
Book Chapter
A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability
Pierre Fraigniaud, Emmanuelle Lebhar and Zvi Lotker
Lecture Notes in Computer Science, 2006, Volume 4168, Algorithms – ESA 2006, Pages 376-386
Journal Article
Degree-Optimal Routing for P2P Systems
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar and Alberto Negro, et al.
Theory of Computing Systems, 2009, Volume 45, Number 1, Pages 43-63
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Pierre Fraigniaud
Lecture Notes in Computer Science, 2007, Volume 4698, Algorithms – ESA 2007, Pages 2-11
Greedy Routing in Tree-Decomposed Graphs
Lecture Notes in Computer Science, 2005, Volume 3669, Algorithms – ESA 2005, Pages 791-802
Survey on hierarchical routing schemes in “flat” distributed hash tables
Dmitry Korzun and Andrei Gurtov
Peer-to-Peer Networking and Applications, 2011, Volume 4, Number 4, Pages 346-375
On a Conjecture Related to Geometric Routing
Christos H. Papadimitriou and David Ratajczak
Lecture Notes in Computer Science, 2004, Volume 3121, Algorithmic Aspects of Wireless Sensor Networks, Pages 9-17
Eclecticism shrinks even small worlds
Pierre Fraigniaud, Cyril Gavoille and Christophe Paul
Distributed Computing, 2005, Volume 18, Number 4, Pages 279-291
Recovering the Long-Range Links in Augmented Graphs
Lecture Notes in Computer Science, 2008, Volume 5058, Structural Information and Communication Complexity, Pages 104-118
Networks Become Navigable as Nodes Move and Forget
Augustin Chaintreau, Pierre Fraigniaud and Emmanuelle Lebhar
Lecture Notes in Computer Science, 2008, Volume 5125, Automata, Languages and Programming, Pages 133-144
Delivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks
Yu Wang, Chih-Wei Yi and Fan Li
Lecture Notes in Computer Science, 2008, Volume 5258, Wireless Algorithms, Systems, and Applications, Pages 4-16
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info