Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Complexity of Diameter on H-free graphs

Published 26 Feb 2024 in cs.DS and cs.DM | (2402.16678v4)

Abstract: The intensively studied Diameter problem is to find the diameter of a given connected graph. We investigate, for the first time in a structured manner, the complexity of Diameter for H-free graphs, that is, graphs that do not contain a fixed graph H as an induced subgraph. We first show that if H is not a linear forest with small components, then Diameter cannot be solved in subquadratic time for H-free graphs under SETH. For some small linear forests, we do show linear-time algorithms for solving Diameter. For other linear forests H, we make progress towards linear-time algorithms by considering specific diameter values. If H is a linear forest, the maximum value of the diameter of any graph in a connected H-free graph class is some constant dmax dependent only on H. We give linear-time algorithms for deciding if a connected H-free graph has diameter dmax, for several linear forests H. In contrast, for one such linear forest H, Diameter cannot be solved in subquadratic time for H-free graphs under SETH. Moreover, we even show that, for several other linear forests H, one cannot decide in subquadratic time if a connected H-free graph has diameter dmax under SETH.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (48)
  1. Subcubic equivalences between graph centrality problems, APSP, and diameter. ACM Trans. Algorithms, 19(1):3:1–3:30, 2023.
  2. What else can Voronoi diagrams do for diameter in planar graphs? In Proc. ESA 2023, volume 274 of LIPIcs, pages 4:1–4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
  3. More applications of the polynomial method to algorithm design. In Proc. SODA 2015, pages 218–230. SIAM, 2015.
  4. Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In Proc. SODA 2016, pages 377–391. SIAM, 2016.
  5. Towards tight approximation bounds for graph diameter and eccentricities. In Proc. STOC 2018, pages 267–280. ACM, 2018.
  6. The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discret. Appl. Math., 82(1-3):43–77, 1998.
  7. Multivariate analysis of orthogonal range searching and graph distances. Algorithmica, 82(8):2292–2315, 2020.
  8. Sergio Cabello. Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. ACM Trans. Algorithms, 15(2):21:1–21:38, 2019.
  9. Deterministic APSP, orthogonal vectors, and more: Quickly derandomizing razborov-smolensky. ACM Trans. Algorithms, 17(1):2:1–2:14, 2021.
  10. Better approximation algorithms for the graph diameter. In Proc. SODA 2014, pages 1041–1052. SIAM, 2014.
  11. Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math., 31:231–234, 2008.
  12. Fast approximation of eccentricities and distances in hyperbolic graphs. JGAA, 23(2):393–433, 2019.
  13. Diameter determination on restricted graph families. Discret. Appl. Math., 113(2-3):143–166, 2001.
  14. On the power of BFS to determine a graph’s diameter. Networks, 42(4):209–222, 2003.
  15. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. ACM Trans. Algorithms, 15(3):33:1–33:57, 2019.
  16. Algorithmic applications of baur-strassen’s theorem: Shortest cycles, diameter, and matchings. J. ACM, 62(4):28:1–28:30, 2015.
  17. Feodor F. Dragan. Centers of graphs and the helly property. Ph. D. Thesis, Moldova State University, 1989.
  18. Feodor F. Dragan. HT-graphs: centers, connected r-domination and steiner trees. Comput. Sci. J. Moldova, 1(2):64–83, 1993.
  19. Feodor F. Dragan. Dominating cliques in distance-hereditary graphs. In Proc. SWAT 1994, volume 824 of LNCS, pages 370–381. Springer, 1994.
  20. αisubscript𝛼𝑖\alpha_{i}italic_α start_POSTSUBSCRIPT italic_i end_POSTSUBSCRIPT-metric graphs: Radius, diameter and all eccentricities. In Proc. WG 2023, volume 14093 of LNCS, pages 276–290. Springer, 2023.
  21. Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. In Proc. WADS 2021, volume 12808 of LNCS, pages 300–314. Springer, 2021.
  22. Eccentricity function in distance-hereditary graphs. Theor. Comput. Sci., 833:26–40, 2020.
  23. Revisiting radius, diameter, and all eccentricity computation in graphs through certificates. CoRR, abs/1803.04660, 2018.
  24. LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. Discret. Appl. Math., 98(3):191–207, 2000.
  25. Lexbfs-orderings and powers of graphs. In Proc. WG 1996, pages 166–180. Springer, 1997.
  26. Faster matrix multiplication via asymmetric hashing. In Proc. FOCS 2023, pages 2129–2138. IEEE, 2023.
  27. Guillaume Ducoffe. Beyond Helly graphs: The diameter problem on absolute retracts. In Proc. WG 2021, volume 12911 of LNCS, pages 321–335. Springer, 2021.
  28. Guillaume Ducoffe. The diameter of AT-free graphs. J. Graph Theory, 99(4):594–614, 2022.
  29. Guillaume Ducoffe. Optimal centrality computations within bounded clique-width graphs. Algorithmica, 84(11):3192–3222, 2022.
  30. Guillaume Ducoffe. Distance problems within Helly graphs and k-Helly graphs. Theor. Comput. Sci., 946:113690, 2023.
  31. A story of diameter, radius, and (almost) Helly property. Networks, 77(3):435–453, 2021.
  32. Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. In Proc. SODA 2020, pages 1905–1922. SIAM, 2020.
  33. Tight hardness results for distance and centrality problems in constant degree graphs. CoRR, abs/1609.08403, 2016.
  34. Computation of the center and diameter of outerplanar graphs. Discret. Appl. Math., 2(3):185–191, 1980.
  35. Voronoi diagrams on planar graphs, and computing the diameter in deterministic o~⁢(n5/3)~𝑜superscript𝑛53{\tilde{o}}(n^{5/3})over~ start_ARG italic_o end_ARG ( italic_n start_POSTSUPERSCRIPT 5 / 3 end_POSTSUPERSCRIPT ) time. SIAM J. Comput., 50(2):509–554, 2021.
  36. A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata. In Proc. STACS 1998, volume 1373 of LNCS, pages 25–38. Springer, 1998.
  37. Split graphs. Congressus Numerantium, 19:311–315, 1977.
  38. Domination when the stars are out. ACM Trans. Algorithms, 15(2):25:1–25:90, 2019.
  39. On the complexity of k-SAT. J. Comput. Syst. Sci., 62(2):367–375, 2001.
  40. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512–530, 2001.
  41. Complexity framework for forbidden subgraphs. CoRR, abs/2211.12887, 2022.
  42. Stephan Olariu. Paw-fee graphs. Information Processing Letters, 28(1):53–54, 1988.
  43. Stephan Olariu. A simple linear-time algorithm for computing the center of an interval graph. Int. J. Comput. Math., 34(3-4):121–128, 1990.
  44. Fast approximation algorithms for the diameter and radius of sparse graphs. In Proc. STOC 2013, pages 515–524. ACM, 2013.
  45. All pairs shortest paths in undirected graphs with integer weights. In Proc. FOCS 1999, pages 605–615. IEEE, 1999.
  46. Approximating the diameter of planar graphs in near linear time. ACM Trans. Algorithms, 12(1):12:1–12:13, 2016.
  47. Ryan Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci., 348(2-3):357–365, 2005.
  48. Uri Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM, 49(3):289–317, 2002.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.

Sign Up for Free