Sergio Cabello
Abstract
The inverse geodesic length of a graph G is the sum of the inverse of the distances between all pairs of distinct vertices of G. In some domains, it is known as the Harary index or the global efficiency of the graph. We show that, if G is planar and has n vertices, then the inverse geodesic length of G can be computed in roughly O(n9/5) time. We also show that, if G has n vertices and treewidth at most k, then the inverse geodesic length of G can be computed in O(n log O(k)n) time. In both cases, we use techniques developed for computing the sum of the distances, which does not have “inverse” component, together with batched evaluations of rational functions.
- [1] . 2016. Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms, (SODA ’16). SIAM, 377–391. Google Scholar
Cross Ref
- [2] . 1998. Geometric range searching and its relatives. In Advances in Discrete and Computational Geometry, , , and (Eds.). AMS, 1–56.Google Scholar
- [3] . 2018. Batched point location in SINR diagrams via algebraic tools. ACM Trans. Algorithms 14, 4 (2018), 41:1–41:29. Google ScholarDigital Library
- [4] . 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6 (1996), 1305–1317. Google ScholarDigital Library
- [5] . 1998. A partial \( k \)-Arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209 (1998), 1–45. Google ScholarDigital Library
- [6] . 2016. A \( c^k n \) 5-approximation algorithm for treewidth. SIAM J. Comput. 45, 2 (2016), 317–378. Google ScholarDigital Library
- [7] . 2020. Multivariate analysis of orthogonal range searching and graph distances. Algorithmica 82, 8 (2020), 2292–2315. Google ScholarDigital Library
- [8] . 2018. Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. ACM Trans. Algorithms 15, 2 (2018), 21:1–21:38. Google ScholarDigital Library
- [9] . 2009. Algorithms for graphs of bounded treewidth via orthogonal range searching. Comput. Geom. 42, 9 (2009), 815–824. Google ScholarDigital Library
- [10] . 2008. Computational Geometry: Algorithms and Applications (3rd ed.). Springer-Verlag. Google ScholarCross Ref
- [11] and (Eds.). 1999. Topological Indices and Related Descriptors in QSAR and QSPR. CRC Press.Google Scholar
- [12] . 2006. Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72, 5 (2006), 868–889. Google ScholarDigital Library
- [13] . 1991. Planar graph decomposition and all pairs shortest paths. J. ACM 38, 1 (1991), 162–204. Google ScholarDigital Library
- [14] . 2019. Minimizing and computing the inverse geodesic length on trees. In Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC 2019) (LIPIcs), Vol. 149. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 59:1–59:19. Google ScholarCross Ref
- [15] . 2021. Voronoi diagrams on planar graphs, and computing the diameter in deterministic \( \tilde{O}(n^{5/3}) \) time. SIAM J. Comput. 50, 2 (2021), 509–554. Google ScholarDigital Library
- [16] . 1997. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55, 1 (1997), 3–23. Google ScholarDigital Library
- [17] . 2013. Structured recursive separator decompositions for planar graphs in linear time. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC ’13). 505–514. See http://arxiv.org/abs/1208.2223 for the full version.Google ScholarDigital Library
- [18] . 1998. A fully dynamic approximation scheme for shortest paths in planar graphs. Algorithmica 22, 3 (1998), 235–249. Google ScholarCross Ref
- [19] . 2001. Efficient behavior of small-world networks. Phys. Rev. Lett. 87 (
Oct 2001), 198701. Issue 19. Google ScholarCross Ref - [20] . 2003. Economic small-world behavior in weighted networks. The European Physical Journal B - Condensed Matter and Complex Systems 32, 2 (
Mar 2003), 249–263. Google ScholarCross Ref - [21] . 1980. Combinatorial solutions of multidimensional divide-and-conquer recurrences. J. Algorithms 1, 1 (1980), 60–74. Google ScholarCross Ref
- [22] . 2016. Computing the distance between piecewise-linear bivariate functions. ACM Trans. Algorithms 12, 1 (2016), 3:1–3:13. Google ScholarDigital Library
- [23] . 1993. On the Harary index for the characterization of chemical graphs. Journal of Mathematical Chemistry 12, 1 (1993), 235–250. Google ScholarCross Ref
- [24] . 2013. Fast approximation algorithms for the diameter and radius of sparse graphs. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC ’13). 515–524. Google ScholarDigital Library
- [25] . 2013. Modern Computer Algebra (3rd ed.). Cambridge University Press.Google ScholarDigital Library
Index Terms
- Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
Recommendations
Total domination in planar graphs of diameter two
MacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar graphs, J. Graph Theory 22 (1996) 213-229] proved that planar graphs of diameter two have domination number at most three. Goddard and Henning [W. Goddard, M.A. ...
Adapted list coloring of planar graphs
Given an edge coloring F of a graph G, a vertex coloring of G is adapted to F if no color appears at the same time on an edge and on its two endpoints. If for some integer k, a graph G is such that given any list assignment L to the vertices of G, with |...
A bound on the treewidth of planar even-hole-free graphs
The class of planar graphs has unbounded treewidth, since the kxk grid, @?k@?N, is planar and has treewidth k. So, it is of interest to determine subclasses of planar graphs which have bounded treewidth. In this paper, we show that if G is an even-hole-...
Comments