Recognition of C4-free and 1/2-hyperbolic graphs

SIAM Journal on Discrete Mathematics

Volumn 28, Issue 3, 2014, Pages 1601-1617

  Coudert, David ^a,b   Ducoffe, Guillaume ^b,c  

^a INRIA   (France)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

C4 free graphs; Discrete metric space; Graph algorithms; Hyperbolicity; Rectangular matrix multiplication

Indexed keywords

FREE GRAPHS; GRAPH ALGORITHMS; HYPERBOLICITY; METRIC SPACES; RECTANGULAR MATRIX;

EID: 84907997911     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/140954787     Document Type: Article

References (41)

1. H.-J. BANDELT AND V. CHEPOI, 1-hyperbolic graphs, SIAM Journal on Discrete Mathematics, 16 (2003), pp. 323-334.
2. H.-J. BANDELT AND V. CHEPOI, Metric graph theory and geometry: a survey, Contemp. Math., 453 (2008), pp. 49-86.
3. H.-J. BANDELT AND H. M. MULDER, Distance-hereditary graphs, J. Combin. Theory Ser. B, 41 (1986), pp. 182-208.
4. J. BARAS, Hyperbolic embedding to the rescue in communication and social networks, in Bell Labs-NIST Workshop on Large-Scale Networks, Murray Hill, NJ, 2013.
5. S. BERMUDO, J. M. RODRÍGUEZ, J. M. SIGARRETA, AND J.-M. VILAIRE, Gromov hyperbolic graphs, Discrete Math., 313 (2013), pp. 1575-1585.
6. M. BOGUÑÁ, F. PAPADOPOULOS, AND D. V. KRIOUKOV, Sustaining the Internet with hyperbolic mapping, Nature Commun., 1 (2010), pp. 1-18.
7. J. A. BONDY AND U. MURTY, Graph theory with applications, Macmillan London, 1976.
8. W. CARBALLOSA, J. M. RODRÍGUEZ, J. M. SIGARRETA, AND M. VILLETA, On the Hyperbolicity Constant of Line Graphs, Electronic J. Combin., 18 (2011), pp. 1-18.
9. J. CHALOPIN, V. CHEPOI, P. PAPASOGLU, AND T. PECATTE, Cop and Robber Game and Hyperbolicity, preprint, arXiv:1308.3987, 2013.
10. V. CHEPOI AND F. DRAGAN, A note on distance approximating trees in graphs, European J. Combin., 21 (2000), pp. 761-766.
11. N. COHEN, D. COUDERT, AND A. LANCIN, Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs, Rapport de recherche RR-8074, INRIA, 2012.
12. D. COPPERSMITH, Rectangular matrix multiplication revisited, J. Complexity, 13 (1997), pp. 42-49.
13. P. DE LA HARPE AND E. GHYS, Sur les groupes hyperboliques d'après Mikhael Gromov, Progr. Math. 83, Birkhäuser, Boston, 1990.
14. R. DIESTEL, Graph Theory, Grad. Texts in Math. 173, Springer, Heidelberg, 1997.
15. D. DOR, S. HALPERIN, AND U. ZWICK, All-pairs almost shortest paths, SIAM Journal on Computing, 29 (2000), pp. 1740-1759.
16. F. F. DRAGAN, Tree-like structures in graphs: A metric point of view, in 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Comput. Sci. 8165, Springer, Berlin 2013, pp. 1-4.
17. F. F. DRAGAN AND E. KÖHLER, An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Lecture Notes in Comput. Sci. 6845, Springer, Heidelberg, 2011, pp. 171-183.
18. A. DRESS, K. HUBER, J. KOOLEN, V. MOULTON, AND A. SPILLNER, Basic Phylogenetic Combinatorics, Cambridge University Press, Cambridge, UK, 2011.
19. R. DUAN, Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces, in 11th Latin American Theoretical Informatics Symposium (LATIN), Montevideo, Uruguay, Lecture Notes in Comput. Sci. 8392, 2014, Springer, Heidelberg, pp. 285-293.
20. D. EPPSTEIN, Subgraph isomorphism in planar graphs and related problems, in 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 1995, pp. 632-640.
21. H. FOURNIER, A. ISMAIL, AND A. VIGNERON, Computing the Gromov hyperbolicity of a discrete metric space, preprint, arXiv:1210.3323, 2012.
22. C. GAVOILLE, D. PELEG, S. PÉRENNES, AND R. RAZ, Distance labeling in graphs, in 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2001, pp. 210-219.
23. M. GROMOV, Hyperbolic groups, in Essays in Group Theory, S. M. Gersten, ed., of Math. Sci. Res. Inst. Publ. 8, Springer, New York, 1987, pp. 75-263.
24. E. HOWORKA, On metric properties of certain clique graphs, J. Combin. Theory Ser. B, 27 (1979), pp. 67-74.
25. X. HUANG AND V. Y. PAN, Fast rectangular matrix multiplication and applications, J. Complexity, 14 (1998), pp. 257-299.
26. S. HUSS-LEDERMAN, E. M. JACOBSON, J. R. JOHNSON, A. TSAO, AND T. TURNBULL, Implementation of Strassen's algorithm for matrix multiplication, in ACM/IEEE Conference on Supercomputing, ACM, New York, 1996, pp. 32-32.
27. E. A. JONCKHEERE AND P. LOHSOONTHORN, A hyperbolic geometric approach to multipath routing, in In Proceedings of the 10th Mediterranean Conference on Control and Automation (MED 2002), Lisbon, Portugal, 2002.
28. P. A. KNIGHT, Fast rectangular matrix multiplication and QR decomposition, Linear Algebra Appl., 221 (1995), pp. 69-81.
29. A. KOSOWSKI, B. LI, N. NISSE, AND K. SUCHAN, k-chordal graphs: From cops and robber to compact routing via treewidth, in International Conference on Automata, Languages, and Programming (ICALP), Lecture Notes in Comput. Sci. 7392, Springer, Heidelberg, 2012, pp. 610-622.
30. R. LASKAR AND D. SHIER, On powers and centers of chordal graphs, Discrete Appl. Math., 6 (1983), pp. 139-147.
31. F. LE GALL, Faster algorithms for rectangular matrix multiplication, in IEEE 53rd Annual Symposium on Foundations of Computer Science, New Brunswick, NJ, 2012, IEEE, Piscataway, NJ, pp. 514-523.
32. D. LOKSHTANOV, Finding the longest isometric cycle in a graph, Discrete Appl. Math., 157 (2009), pp. 2670-2674.
33. J. MICHEL, J. M. RODRÍGUEZ, J. M. SIGARRETA, AND M. VILLETA, Hyperbolicity and parameters of graphs, Ars Combin., 100 (2011), pp. 43-63.
34. L. RODITTY AND V. V. WILLIAMS, Minimum weight cycles and triangles: Equivalences and algorithms, in 52nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 2011, pp. 180-189.
35. J. M. RODRÍGUEZ AND J. M. SIGARRETA, Bounds on Gromov hyperbolicity constant in graphs, in Proc. Indian Acad. Sci. Math. Sci., 122, 2012, pp. 53-65.
36. R. SEIDEL, On the all-pairs-shortest-path problem in unweighted undirected graphs, J. Comput. System Sci., 51 (1995), pp. 400-403.
37. J. P. SPINRAD, Finding large holes, Inform. Process. Lett., 39 (1991), pp. 227-229.
38. V. V. WILLIAMS, Multiplying matrices faster than Coppersmith-Winograd, in 44th symposium on Theory of Computing (STOC), ACM, New York, 2012, pp. 887-898.
39. V. V. WILLIAMS AND R. WILLIAMS, Subcubic equivalences between path, matrix and triangle problems, in 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, NJ, 2010, pp. 645-654.
40. Y. WU AND C. ZHANG, Hyperbolicity and chordality of a graph, Electronic J. Combin., 18 (2011), P43.
41. R. YUSTER AND U. ZWICK, Fast sparse matrix multiplication, ACM Trans. Algorithms, 1 (2005), pp. 2-13.