Abstract
Cops and robber games concern a team of cops that must capture a robber moving in a graph. We consider the class of k-chordal graphs, i.e., graphs with no induced cycle of length greater than k, k ≥ 3. We prove that k − 1 cops are always sufficient to capture a robber in k-chordal graphs. This leads us to our main result, a new structural decomposition for a graph class including k-chordal graphs.
We present a quadratic algorithm that, given a graph G and k ≥ 3, either returns an induced cycle larger than k in G, or computes a tree-decomposition of G, each bag of which contains a dominating path with at most k − 1 vertices. This allows us to prove that any k-chordal graph with maximum degree Δ has treewidth at most (k − 1)(Δ − 1) + 2, improving the O(Δ(Δ − 1)k − 3) bound of Bodlaender and Thilikos (1997). Moreover, any graph admitting such a tree-decomposition has small hyperbolicity.
As an application, for any n-node graph admitting such a tree-decomposition, we propose a compact routing scheme using routing tables, addresses and headers of size O(logn) bits and achieving an additive stretch of O(klogΔ). As far as we know, this is the first routing scheme with O(k logΔ + logn)-routing tables and small additive stretch for k-chordal graphs.
Partially supported by programs Fondap and Basal-CMM, Anillo ACT88 and Fondecyt 11090390 (K.S.), FP7 STREP EULER (N.N.).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Discrete Methods 8, 277–284 (1987)
Abraham, I., Gavoille, C.: Object location using path separators. In: PODC, pp. 188–197. ACM (2006)
Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: Lower bounds. In: SPAA, pp. 217–224 (2006)
Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: ICDCS, p. 75 (2006)
Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM T. Alg. 4(3) (2008)
Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358–402 (1996)
Bonato, A., Nowakovski, R.: The game of Cops and Robber on Graphs. American Math. Soc. (2011)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1-2), 1–45 (1998)
Bodlaender, H.L., Thilikos, D.M.: Treewidth for graphs with small chordality. Disc. Ap. Maths 79(1-3), 45–61 (1997)
Chen, Y., Flum, J.: On parameterized path and chordless path problems. In: CCC, pp. 250–263 (2007)
Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. TCS 109, 49–82 (1993)
Clarke, N.E., Nowakowski, R.J.: Tandem-win graphs. Discrete Mathematics 299(1-3), 56–64 (2005)
Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Mathematics 307(16), 2008–2029 (2007)
de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the internet. In: NCA, pp. 25–32. IEEE Comp. Soc. (2011)
Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. J. of Graph Alg. and App. 9(2), 277–297 (2005)
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)
Gromov, M.: Hyperbolic groups. Essays in Group Theory 8, 75–263 (1987)
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)
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
Krioukov, D.V., Papadopoulos, F., Boguñá, M., Vahdat, A.: Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces. SIGMETRICS Performance Evaluation Review 37(2), 15–17 (2009)
Nisse, N., Suchan, K., Rapaport, I.: Distributed computing of efficient routing schemes in generalized chordal graphs. TCS (to appear, 2012)
Watts, D.J., Strogatz, S.: Collective dynamics of ’small-world’ networks. Nature 393(6684), 440–442 (1998)
Wu, Y., Zhang, C.: Hyperbolicity and chordality of a graph. Electr. J. Comb. 18(1) (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kosowski, A., Li, B., Nisse, N., Suchan, K. (2012). k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31585-5_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-31585-5_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31584-8
Online ISBN: 978-3-642-31585-5
eBook Packages: Computer ScienceComputer Science (R0)