K-Chordal graphs: From cops and robber to compact routing via treewidth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 610-622

  Kosowski, Adrian ^a   Li, Bi ^b,c   Nisse, Nicolas ^b   Suchan, Karol ^d,e  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^d UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^e AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

chordality; compact routing; cops and robber games; Treewidth

Indexed keywords

ADDITIVES; AUTOMATA THEORY; GRAPH ALGORITHMS; GRAPHIC METHODS; NETWORK ROUTING; ROBOTS; ROUTING PROTOCOLS;

CHORDAL GRAPHS; CHORDALITY; COMPACT ROUTING; COPS AND ROBBERS; QUADRATIC ALGORITHMS; STRUCTURAL DECOMPOSITION; TREE DECOMPOSITION; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 84884194802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_54     Document Type: Conference Paper

References (23)

1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Discrete Methods 8, 277-284 (1987)
2. Abraham, I., Gavoille, C.: Object location using path separators. In: PODC, pp. 188-197. ACM (2006)
3. Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: Lower bounds. In: SPAA, pp. 217-224 (2006)
4. Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: ICDCS, p. 75 (2006)
5. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM T. Alg. 4(3) (2008)
6. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358-402 (1996)
7. Bonato, A., Nowakovski, R.: The game of Cops and Robber on Graphs. American Math. Soc. (2011)
8. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1-2), 1-45 (1998)
9. Bodlaender, H.L., Thilikos, D.M.: Treewidth for graphs with small chordality. Disc. Ap. Maths 79(1-3), 45-61 (1997)
10. Chen, Y., Flum, J.: On parameterized path and chordless path problems. In: CCC, pp. 250-263 (2007)
11. Courcelle, B., Mosbah, M.: Monadic second-order evaluations on treedecomposable graphs. TCS 109, 49-82 (1993)
12. Clarke, N.E., Nowakowski, R.J.: Tandem-win graphs. Discrete Mathematics 299(1-3), 56-64 (2005)
13. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Mathematics 307(16), 2008-2029 (2007)
14. de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the internet. In: NCA, pp. 25-32. IEEE Comp. Soc. (2011)
15. Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. J. of Graph Alg. and App. 9(2), 277-297 (2005)
16. Fraigniaud, P., Gavoille, C.: Routing in Trees. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757-772. Springer, Heidelberg (2001)
17. Gromov, M.: Hyperbolic groups. Essays in Group Theory 8, 75-263 (1987)
18. Kobayashi, Y., Kawarabayashi, K.: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. In: 20th Annual ACM-SIAM Symp. on Discrete Alg. (SODA), pp. 1146-1155. SIAM (2009)
19. Kosowski, A., Li, B., Nisse, N., Suchan, K.: k-chordal graphs: from cops and robber to compact routing via treewidth, Report, INRIA-RR7888 (2012), http://www-sop.inria.fr/members/Bi.Li/RR-7888.pdf
20. Krioukov, D.V., Papadopoulos, F., Boguñ́a, M., Vahdat, A.: Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces. SIGMETRICS Performance Evaluation Review 37(2), 15-17 (2009)
21. Nisse, N., Suchan, K., Rapaport, I.: Distributed computing of efficient routing schemes in generalized chordal graphs. TCS (to appear, 2012)
22. Watts, D.J., Strogatz, S.: Collective dynamics of 'small-world' networks. Nature 393(6684), 440-442 (1998)
23. Wu, Y., Zhang, C.: Hyperbolicity and chordality of a graph. Electr. J. Comb. 18(1) (2011)