Greedy routing in tree-decomposed graphs

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 791-802

  Fraigniaud, Pierre ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY; PROBABILITY DISTRIBUTIONS; ROUTERS;

CHORDAL GRAPHS; GREEDY ROUTING; TREE DECOMPOSITION; TREEWIDTH;

TREES (MATHEMATICS);

EID: 27144496651     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_70     Document Type: Conference Paper

References (35)

1. L. Adamic, and E. Adar. How To Search a Social Network. Social Networks. Preprint submitted to Social Networks, 2004.
2. M. Aldenderfer and R. Blashfield. Cluster Analysis. Quantitative Applications in the Social Sciences, Vol. 44, SAGE Publications, London, 1984.
3. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Journal of the ACM 40(5), pages 1134-1164, 1993.
4. J. Aspnes, Z. Diamadi, and G. Shah. Fault-Tolerant Routing in Peer-to-Peer Systems. In 21st ACM Symp. on Principles of Distributed Computing (PODC), pages 223-232, 2002.
5. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient Routing in Networks with Long Range Contacts. In 15th International Symposium on Distributed Computing (DISC), LNCS 2180, pages 270-284, Springer, 2001.
6. H. Bodlaender. Treewidth: algorithmic techniques and results. In 22nd Symp. on Mathematical foundations of computer science (MFCS), LNCS 1295, pages 19-36, Springer, 1997.
7. H. Bodlaender, J. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating Treewidth, Pathwidth, Frontsize and Shortest Elimination Trees. Journal of Algorithms 18, pages 238-255, 1995.
8. H. Bodlaender and D. Thilikos. Treewidth for Graphs with Small Chordality. Discrete Applied Mathematics 79(1-3):45-61, 1997.
9. V. Bouchitté, D. Kratsch, H. Müller, and I. Todinca. On treewidth approximations. Discrete Applied Mathematics 136, pages 183-196, 2004.
10. A. Clauset, M. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004).
11. D. Coppersmith, D. Gamarnik, and M. Sviridenko. The Diameter of a Long-Range Percolation Graph. Random Structures and Algorithms 21(1): 1-13, 2002.
12. B. Courcelle, J. Makowsky, and U. Rotics. Linear-time solvable optimization problems on graphs of bounded cliquewidth. In 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 1517, pages 1-16, Springer, 1998.
13. P. Dodds, R. Muhamad, and D. Watts. An Experimental Study of Search in Global Social Networks. Science 301:827-829, 2003.
14. L. Donetti and M. Muñoz. Detecting Network Communities: A New Systematic and Efficient Algorithm. J. of Statistical Mechanics: Theory and Experiment, P10012, 2004.
15. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small world? Technical Report LIP RR-2004-61, ENS-Lyon, Dec 2004.
16. B. Everitt, S. Landau and M. Leese. Cluster Analysis. Arnold, London, 4th edition, 2001.
17. U. Feige, M. Hajiaghayi, and J. Lee. Improved approximation algorithms for minimum-weight vertex separators. In 37th ACM Symposium on Theory of Computing (STOC), 2005.
18. P. Fraigniaud and C. Gavoille. Routing in trees. In 29th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 2076, pages 757-772, Springer, 2001.
19. P. Fraigniaud and C. Gavoille. End-to-end routing. In 17th Symposium on Distributed Computing (DISC), LNCS 2848, pages 211-223, Springer, 2003.
20. P. Fraigniaud, C. Gavoille, and C. Paul. Eclecticism shrinks even small worlds. In 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 169-178, 2004.
21. C. Gavoille, M. Katz, N. Katz, C. Paul, and D. Peleg. Approximate Distance Labeling Schemes. In 9th European Symposium on Algorithms (ESA), LNCS 2161, pages 476-487, Springer, 2001.
22. M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New-York, 1980.
23. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In 32nd ACM Symp. on Theory of Computing (STOC), pages 163-170, 2000.
24. J. Kleinberg. Navigation in a Small-World. Nature 406:845, 2000.
25. J. Kleinberg. Small-World Phenomena and the Dynamics of Information. In 15th Neural Information Processing Systems (NIPS), 2001.
26. E. Lebhar and N. Schabanel. Searching for optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages and Programming (ICALP), LNCS 3142, pages 894-905, Springer, 2004.
27. G. Manku, M. Naor, and U. Wieder. Know Thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks. In 36th ACM Symp. on Theory of Computing (STOC), 2004.
28. C. Martel and V. Nguyen. Analyzing Kleinberg's (and other) Small-world Models. In 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 178-187, 2004.
29. C. Martel and V. Nguyen. Analyzing and Charaterizing Small-World Graphs. In 16th ACM Symp. on Discrete Algorithms (SODA), 2005.
30. F. Menczer. Growing and Navigating the Small World Web by Local Content. Proc. Natl. Acad. Sci. USA 99(22):14014-14019, 2002.
31. S. Milgram. The Small-World Problem. Psychology Today, 60-67, 1967.
32. N. Megiddo, S. Hakimi, M. Garey, D. Johnson and C. Papadimitriou. The complexity of searching a graph. Journal of the ACM 35(1), pages 18-44, 1988.
33. N. Robertson and P. D. Seymour. Graph minors II, Algorithmic Aspects of Tree-Width. Journal of Algorithms 7, pages 309-322, 1986.
34. D. J. Watts, P. S. Dodds, M. E. J. Newman. Identity and Search in Social Networks. Science 296:1302-1305, 2002.
35. D. Watts and S. Strogatz. Collective Dynamics of Small-World Networks. Nature 393:440-442, 1998.