Document Open Access Logo

Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs

Authors Lech Duraj , Filip Konieczny , Krzysztof Potępa

PDF
Thumbnail PDF

File

LIPIcs.ESA.2024.51.pdf
  • Filesize: 0.81 MB
  • 18 pages

Document Identifiers

Author Details

Lech Duraj
  • Faculty of Mathematics and Computer Science, Jagiellonian University in Kraków, Poland
Filip Konieczny
  • Faculty of Mathematics and Computer Science, Jagiellonian University in Kraków, Poland
Krzysztof Potępa
  • Faculty of Mathematics and Computer Science, Jagiellonian University in Kraków, Poland

Funding

All authors were supported by National Science Center of Poland grant 2019/34/E/ST6/ 00443.
  • Konieczny, Filip: During the preparation of this article, Filip Konieczny was a participant of the tutoring programme under the Excellence Initiative at the Jagiellonian University.

Acknowledgements

We would like to thank the reviewers for helping to improve our paper with their suggestions.

Cite AsGet BibTex

Lech Duraj, Filip Konieczny, and Krzysztof Potępa. Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 51:1-51:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024.51

Abstract

We develop a framework for algorithms finding the diameter in graphs of bounded distance Vapnik-Chervonenkis dimension, in (parameterized) subquadratic time complexity. The class of bounded distance VC-dimension graphs is wide, including, e.g. all minor-free graphs. We build on the work of Ducoffe et al. [SODA'20, SIGCOMP'22], improving their technique. With our approach the algorithms become simpler and faster, working in 𝒪{(k ⋅ n^{1-1/d} ⋅ m ⋅ polylog(n))} time complexity for the graph on n vertices and m edges, where k is the diameter and d is the distance VC-dimension of the graph. Furthermore, it allows us to use the improved technique in more general setting. In particular, we use this framework for geometric intersection graphs, i.e. graphs where vertices are identical geometric objects on a plane and the adjacency is defined by intersection. Applying our approach for these graphs, we partially answer a question posed by Bringmann et al. [SoCG'22], finding an 𝒪{(n^{7/4} ⋅ polylog(n))} parameterized diameter algorithm for unit square intersection graph of size n, as well as a more general algorithm for convex polygon intersection graphs.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Computational geometry
Keywords
  • Graph Diameter
  • Geometric Intersection Graphs
  • Vapnik-Chervonenkis Dimension

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Amir Abboud, Mina Dalirrooyfard, Ray Li, and Virginia Vassilevska Williams. On Diameter Approximation in Directed Graphs. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA 2023), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 2:1-2:17, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.2.
  2. Amir Abboud, Virginia Vassilevska Williams, and Joshua Wang. Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete Algorithms, pages 377-391. SIAM, 2016. Google Scholar
  3. Édouard Bonnet. 4 vs 7 sparse undirected unweighted diameter is seth-hard at time n 4/3. ACM Transactions on Algorithms (TALG), 18(2):1-14, 2022. Google Scholar
  4. Nicolas Bousquet and Stéphan Thomassé. Vc-dimension and erdős-pósa property. Discrete Mathematics, 338(12):2302-2317, 2015. Google Scholar
  5. Karl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, André Nusser, and Zahra Parsaeian. Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry (SoCG 2022), volume 224 of Leibniz International Proceedings in Informatics (LIPIcs), pages 21:1-21:16, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SoCG.2022.21.
  6. Sergio Cabello. Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. ACM Transactions on Algorithms (TALG), 15(2):1-38, 2018. Google Scholar
  7. Massimo Cairo, Roberto Grossi, and Romeo Rizzi. New bounds for approximating extremal distances in undirected graphs. In Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 363-376. SIAM, 2016. Google Scholar
  8. Timothy M Chan and Dimitrios Skrepetos. All-pairs shortest paths in unit-disk graphs in slightly subquadratic time. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Google Scholar
  9. Timothy M Chan and Dimitrios Skrepetos. All-pairs shortest paths in geometric intersection graphs. In Workshop on Algorithms and Data Structures, pages 253-264. Springer, 2017. Google Scholar
  10. Hsien-Chih Chang, Jie Gao, and Hung Le. Computing diameter+2 in truly subquadratic time for unit-disk graphs, 2024. URL: https://arxiv.org/abs/2401.12881.
  11. Bernard Chazelle and Emo Welzl. Quasi-optimal range searching in spaces of finite vc-dimension. Discrete & Computational Geometry, 4:467-489, 1989. Google Scholar
  12. Shiri Chechik, Daniel H Larkin, Liam Roditty, Grant Schoenebeck, Robert E Tarjan, and Virginia Vassilevska Williams. Better approximation algorithms for the graph diameter. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1041-1052. SIAM, 2014. Google Scholar
  13. Victor Chepoi, Bertrand Estellon, and Yann Vaxes. Covering planar graphs with a fixed number of balls. Discrete & Computational Geometry, 37:237-244, 2007. Google Scholar
  14. Derek G Corneil, Feodor F Dragan, Michel Habib, and Christophe Paul. Diameter determination on restricted graph families. Discrete Applied Mathematics, 113(2-3):143-166, 2001. Google Scholar
  15. M. Dalirrooyfard, R. Li, and V. Williams. Hardness of approximate diameter: Now for undirected graphs. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 1021-1032, Los Alamitos, CA, USA, February 2022. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS52979.2021.00102.
  16. Mina Dalirrooyfard and Nicole Wein. Tight conditional lower bounds for approximating diameter in directed graphs. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pages 1697-1710, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3406325.3451130.
  17. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden. A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. SIAM Journal on Computing, 49(6):1291-1331, 2020. URL: https://doi.org/10.1137/20M1320870.
  18. Guillaume Ducoffe, Michel Habib, and Laurent Viennot. Diameter computation on h-minor free graphs and graphs of bounded (distance) vc-dimension. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1905-1922. SIAM, 2020. Google Scholar
  19. Guillaume Ducoffe, Michel Habib, and Laurent Viennot. Diameter, eccentricities and distance oracle computations on h-minor free graphs and graphs of bounded (distance) vapnik–chervonenkis dimension. SIAM Journal on Computing, 51(5):1506-1534, 2022. URL: https://doi.org/10.1137/20M136551X.
  20. David Eisenstat and Dana Angluin. The vc dimension of k-fold union. Information Processing Letters, 101(5):181-184, 2007. Google Scholar
  21. Arthur M Farley and Andrzej Proskurowski. Computation of the center and diameter of outerplanar graphs. Discrete Applied Mathematics, 2(3):185-191, 1980. Google Scholar
  22. Paweł Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, and Oren Weimann. Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n^5/3) time. SIAM Journal on Computing, 50(2):509-554, 2021. Google Scholar
  23. David Haussler and Emo Welzl. Epsilon-nets and simplex range queries. In Proceedings of the second annual symposium on Computational geometry, pages 61-71, 1986. Google Scholar
  24. Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-sat. Journal of Computer and System Sciences, 62(2):367-375, 2001. Google Scholar
  25. Ray Li. Improved seth-hardness of unweighted diameter. CoRR, abs/2008.05106 v1, 2020. Google Scholar
  26. Ray Li. Settling seth vs. approximate sparse directed unweighted diameter (up to (nu)nseth). In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pages 1684-1696, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3406325.3451045.
  27. Stephan Olariu. A simple linear-time algorithm for computing the center of an interval graph. International Journal of Computer Mathematics, 34(3-4):121-128, 1990. Google Scholar
  28. Liam Roditty and Virginia Vassilevska Williams. Fast approximation algorithms for the diameter and radius of sparse graphs. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 515-524, 2013. Google Scholar
  29. Norbert Sauer. On the density of families of sets. Journal of Combinatorial Theory, Series A, 13(1):145-147, 1972. Google Scholar
  30. Saharon Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific Journal of Mathematics, 41(1):247-261, 1972. Google Scholar
  31. V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability & Its Applications, 16(2):264-280, 1971. URL: https://doi.org/10.1137/1116025.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact