Hyperbolicity and chordality of a graph

Electronic Journal of Combinatorics

Volumn 18, Issue 1, 2011, Pages

  Wu, Yaokun ^a   Zhang, Chengpeng ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Isometric subgraph; Metric; Tree likeness

Indexed keywords

EID: 79953000537     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/530     Document Type: Article

References (80)

1. I. Abraham, M. Balakrishnan, F. Kuhn, D. Malkhi, V. Ramasubramanian, K. Talwar, Reconstructing approximate tree metrics, PODC 2007, 43-52.
2. J.M. Alonso, T. Brady, D. Cooper, V. Ferlini, M. Lustig, M. Mihalik, M. Shapiro, H. Short, Notes on word hyperbolic groups, Group Theory from a Geometrical View- point, ICTP Trieste 1990 (E. Ghys, A. Haefliger, A. Verjovsky, eds.), World Scientific, 1991, pp. 3-63. Available at: http://homeweb1.unifr.ch/ciobanul/pub/Teaching/kggt/MSRInotes2004.pdf
3. R.P. Anstee, M. Farber, On bridged graphs and cop-win graphs, Journal of Combinatorial Theory A 44 (1988), 22-28.
4. S. Arnborg, J. Lagergren, D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms 12 (1991), 308-340.
5. P. Bahls, Asymptotic connectivity of infinite graphs, Discrete Mathematics 309 (2009), 2250-2259.
6. H-J. Bandelt, V. Chepoi, 1-Hyperbolic graphs, SIAM Journal on Discrete Mathematics 16 (2003), 323-334.
7. H-J. Bandelt, V. Chepoi, Metric graph theory and geometry: A survey, in: Surveys on Discrete and Computational Geometry: Twenty Years Later, J.E. Goodman, J. Pach, R. Pollack (eds.), AMS, pp. 49-86, 2008.
8. H-J. Bandelt, H.M. Mulder, Distance-hereditary graphs, Journal of Combinatorial Theory B 41 (1986), 182-208.
9. H.L. Bodlaender, J. Engelfriet, Domino treewidth, Journal of Algorithms 24 (1997), 94-123.
10. H.L. Bodlaender, D.M. Thilikos, Treewidth for graphs with small chordality, Discrete Applied Mathematics 79 (1997), 45-61.
11. B. Bowditch, Notes on Gromov's hyperbolicity criterion for path-metric spaces, in: Group Theory from a Geometrical Viewpoint, E. Ghys, A. Haefliger, A. Verjovsky (eds.), World Scientific, Singapore, pp. 64-167, 1991.
12. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph Classes: A Survey, SIAM, 1999.
13. M. Bridson, A. Haefliger, Metric Spaces of Non-Positive Curvature, Springer, Berlin, 1999.
14. G. Brinkmann, J.H. Koolen, V. Moulton, On the hyperbolicity of chordal graphs, Annals of Combinatorics 5 (2001), 61-69.
15. L.S. Chandran, V.V. Lozin, C.R. Subramanian, Graphs of low chordality, Discrete Mathematics & Theoretical Computer Science 7 (2005), 25-36.
16. L.S. Chandran, L.S. Ram, On the number of minimum cuts in a graph, SIAM Journal on Discrete Mathematics 18 (2004), 177-194.
17. M-S. Chang, H. M̈uller, On the tree-degree of graphs, Lecture Notes in Computer Science 2204 (2001), 44-54.
18. B. Chen, S.-T. Yau, Y.-N. Yeh, Graph homotopy and Graham homotopy, Discrete Mathematics 241 (2001), 153-170.
19. H. Chen, V. Dalmau, Beyond hypertree width: Decomposition methods without decompositions, Lecture Notes in Computer Science 3709 (2005), 167-181.
20. V. Chepoi, F. Dragan, B. Estellon, M. Habib, Y. Vaxés, Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs, Electronic Notes in Discrete Mathematics 31 (2008), 231-234.
21. V. Chepoi, F. Dragan, B. Estellon, M. Habib, Y. Vaxés, Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs, Annual Symposium on Computational Geometry pp. 59-68, 2008.
22. V. Chepoi, F.F. Dragan, B. Estellon, M. Habib, Y. Vaxés, Y. Xiang, Additive spanners and distance and routing labeling schemes for hyperbolic graphs, submitted. Available at: http://pageperso.lif.univ-mrs.fr/~victor.chepoi/HypRoutJournal.pdf
23. V. Chepoi, B. Estellon, Packing and covering δ-hyperbolic spaces by balls, Lecture Notes in Computer Science 4627 (2007), 59-73.
24. D. Cohen, P. Jeavons, M. Gyssens, A unified theory of structural tractability for constraint satisfaction problems, Journal of Computer and System Sciences 74 (2008), 721-743.
25. E. Dahlhaus, P.L. Hammer, F. Maffray, S. Olariu, On domination elimination orderings and domination graphs, Lecture Notes in Computer Science 903 (1994), 81-92.
26. N.D. Dendris, L.M. Kirousis, D.M. Thilikos, Fugitive-search games on graphs and related parameters, Theoretical Computer Science 172 (1997), 233-254.
27. M.M. Deza, E. Deza, Encyclopedia of Distances, Springer, 2009.
28. R. Diestel, Graph Theory, Springer, 1997.
29. M. Dinitz, Online, dynamic, and distributed embeddings of approximate ultrametrics, Lecture Notes in Computer Science 5218 (2008), 152-166.
30. Y. Dourisboure, C. Gavoille, Tree-decompositions with bags of small diameter, Discrete Mathematics 307 (2007), 2008-2029.
31. R.G. Downey, C. McCartin, Bounded persistence pathwidth, in: M. Atkinson and F. Dehne, editors, Eleventh Computing: The Australasian Theory Symposium (CATS2005), volume 41 of CRPIT, pages 51-56, Newcastle, Australia, 2005. ACS (Australian Computer Society).
32. R.G. Downey, C. McCartin, Online promise problems with online width metrics, Journal of Computer and System Sciences 73 (2007), 57-72.
33. F.F. Dragan, Y. Xiang, How to use spanning trees to navigate in graphs, Lecture Notes in Computer Science 5734 (2009), 282-294.
34. A. Dress, Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces, Advances in Mathematics 53 (1984), 321-402.
35. A. Dress, B. Holland, K.T. Huber, J.H. Koolen, V. Moulton, J. Weyer-Menkhoff, Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform, Discrete Applied Mathematics 146 (2005), 51-73.
36. A. Dress, K.T. Huber, V. Moulton, Some uses of the Farris transform in mathematics and phylogenetics - A Review, Annals of Combinatorics 11 (2007), 1-37.
37. A. Dress, V. Moulton, M. Steel, Trees, taxonomy, and strongly compatible multi-state characters, Advances in Applied Mathematics 19 (1997), 1-30.
38. A. Dress, V. Moulton, W. Terhalle, T-theory: An overview, European Journal of Combinatorics 17 (1996), 161-175.
39. R. Duke, Types of cycles in hypergraphs, Annals of Discrete Mathematics 27 (1985), 399-418.
40. R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes, Journal of the Association for Computing Machinery 30 (1983), 514-550.
41. M. Farber, R.E. Jamison, On local convexities in graphs, Discrete Mathematics 66 (1987), 231-247.
42. J.S. Farris, A.G. Kluge, M.J. Eckardt, A numerical approach to phylogenetic systematics, Systematic Zoology (continued by Syst. Biol.) 19 (1970), 172-189.
43. T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae (continued by Acta Math. Hungar.) 18 (1967), 25-66.
44. C. Gavoille, O. Ly, Distance labeling in hyperbolic graphs, Lecture Notes in Computer Science 3827 (2005), 1071-1079.
45. F. Gavril, Algorithms for maximum weight induced paths, Information Processing Letters 81 (2002), 203-208.
46. M.C. Golumbic, C.L. Monma, W.T. Trotter, Tolerance graphs, Discrete Applied Mathematics 9 (1984), 157-170.
47. M.C. Golumbic, A.N. Trenk, Tolerance Graphs, Cambridge University Press, Cambridge, 2004.
48. G. Gottlob, N. Leone, F. Scarcello, Hypertree decompositions and tractable queries, Journal of Computer and System Sciences 64 (2002), 579-627.
49. M. Gromov, Hyperbolic groups, in: Essays in Group Theory, S. Gersten (ed.), MSRI Series, 8, Springer-Verlag, pp. 75-263, 1987.
50. A. Gupta, R. Krauthgamer, J.R. Lee, Bounded geometries, fractals, and low-distortion embeddings, 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), pp. 534-543, 2003.
51. R.B. Hayward, Weakly triangulated graphs, Journal of Combinatorial Theory B 39 (1985), 200-208.
52. P. Hliněńy, S-I. Oum, D. Seese, G. Gottlob, Width parameters beyond tree-width and their applications, The Computer Journal 51 (2008), 326-362.
53. E. Howorka, On metric properties of certain clique graphs, Journal of Combinatorial Theory B 27 (1979), 67-74.
54. P. Hunter, S. Kreutzer, Digraph measures: Kelly decompositions, games, and orderings, Theoretical Computer Science 399 (2008), 206-219.
55. W. Imrich, On metric properties of tree-like spaces, Contribution to graph theory and its applications (Internat. Colloq. Oberhof, 1977) pp. 129-156, Tech. Hochschule Ilmenau, Ilmenau, 1977.
56. E. Jonckheere, P. Lohsoonthorn, F. Bonahon, Scaled Gromov hyperbolic graphs, Journal of Graph Theory 57 (2008), 157-180.
57. E. Jonckheere, M. Lou, J. Hespanha, P. Barooah, Effective resistance of Gromov-hyperbolic graphs: Application to asymptotic sensor network problems, 46th IEEE Conference on Decision and Control (2007), 1453-1458.
58. L.M. Kirousis, D.M. Thilikos, The linkage of a graph, SIAM Journal on Computing 25 (1996), 626-647.
59. V. Klee, What is the maximum length of a d-dimensional snake? The American Mathematical Monthly 77 (1970), 63-65.
60. R. Kleinberg, Geographic routing using hyperbolic space, INFOCOM (2007), 1902-1909.
61. J.H. Koolen, V. Moulton, Hyperbolic bridged graphs, European Journal of Combinatorics 23 (2002), 683-699.
62. F.R. Kschischang, B.J. Frey, H-A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory 47 (2001), 498-519.
63. M. Laurent, On the sparsity order of a graph and its deficiency in chordality, Combinatorica 21 (2001), 543-570.
64. V.B. Le, J. Spinrad, Consequence of an algorithm for bridged graphs, Discrete Applied Mathematics 280 (2004), 271-274.
65. T.T. Lee, The Euler formula of cyclomatic numbers of hypergraphs, Southeast Asian Bulletin of Mathematics 21 (1997), 113-137.
66. D.R. Lick, A.T. White, k-Degenerate graphs, Canadian Journal of Mathematics 22 (1970), 1082-1096.
67. T.A. McKee, E.R. Scheinerman, On the chordality of a graph, Journal of Graph Theory 17 (1993), 221-232.
68. V. Moulton, M. Steel, Retractions of finite distance functions onto tree metrics, Discrete Applied Mathematics 91 (1999), 215-233.
69. F.S. Roberts, On the boxicity and cubicity of a graph, in: Recent Progresses in Combinatorics, Academic Press, New York, 1969, pp. 301-310.
70. N. Robertson, P.D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory B 36 (1984), 49-63.
71. N. Robertson, P.D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms 7 (1986), 309-322.
72. I. Rusu, J. Spinrad, Domination graphs: Examples and counterexamples, Discrete Applied Mathematics 110 (2001), 289-300.
73. Y. Shavitt, T. Tankel, Hyperbolic embedding of internet graph for distance estimation and overlay construction, IEEE/ACM Transactions on Networking 16 (2008), 25-36.
74. V.P. Soltan, V.D. Chepoi, Conditions for invariance of set diameters under d-convexification in a graph, Cybernetics 19 (1983), 750-756.
75. M. Thorup, All structured programs have small tree-width and good register allocation, Information and Computation 142 (1998), 159-181.
76. R. Uehara, Tractable and intractable problems on generalized chordal graphs, IEICE Technical Report, COMP98-83, pages 1-8, 1999. Available at: http://www.jaist.ac.jp/~uehara/pub/tech.html
77. K. Umezawa, K. Yamazaki, Tree-length equals branch-length, Discrete Mathematics 309 (2009), 4656-4660.
78. J. Väisälä, Gromov hyperbolic spaces, Expositiones Mathematicae 23 (2005), 187-231.
79. D.R. Wood, On tree-partition-width, European Journal of Combinatorics 30 (2009), 1245-1253.
80. A. Yamaguchi, K.F. Aoki, H. Mamitsuka, Graph complexity of chemical compounds in biological pathways, Genome Informatics 14 (2003), 376-377.