Abstract
When can we compute the diameter of a graph in quasi linear time? We address this question for the class of split graphs, that we observe to be the hardest instances for deciding whether the diameter is at most two. We stress that although the diameter of a non-complete split graph can only be either 2 or 3, under the Strong Exponential-Time Hypothesis (SETH) we cannot compute the diameter of a split graph in less than quadratic time. Therefore it is worth to study the complexity of diameter computation on subclasses of split graphs, in order to better understand the complexity border. Specifically, we consider the split graphs with bounded clique-interval number and their complements, with the former being a natural variation of the concept of interval number for split graphs that we introduce in this paper. We first discuss the relations between the clique-interval number and other graph invariants and then almost completely settle the complexity of diameter computation on these subclasses of split graphs:
-
For the k-clique-interval split graphs, we can compute their diameter in truly subquadratic time if \(k=\mathcal{O}(1)\), and even in quasi linear time if \(k=o(\log {n})\) and in addition a corresponding ordering is given. However, under SETH this cannot be done in truly subquadratic time for any \(k = \omega (\log {n})\).
-
For the complements of k-clique-interval split graphs, we can compute their diameter in truly subquadratic time if \(k=\mathcal{O}(1)\), and even in time \(\mathcal{O}(km)\) if a corresponding ordering is given. Again this latter result is optimal under SETH up to polylogarithmic factors.
Our findings raise the question whether a k-clique interval ordering can always be computed in quasi linear time. We prove that it is the case for \(k=1\) and for some subclasses such as bounded-treewidth split graphs, threshold graphs and comparability split graphs. Finally, we prove that some important subclasses of split graphs – including the ones mentioned above – have a bounded clique-interval number. A research report version is deposited on HAL repository with number hal-02307397.
G. Ducoffe—This work was supported by a grant of Romanian Ministry of Research and Innovation CCCDI-UEFISCDI. Project no. 17PCCDI/2018.
M. Habib—Supported by Inria Gang project-team, and ANR project DISTANCIA (ANR-17-CE40-0015).
L. Viennot—Supported by Irif laboratory from CNRS and Paris University, and ANR project Multimod (ANR-17-CE22-0016).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This sparse representation is also called the neighbourhood set system of the stable set of G, see Sect. 2.
- 2.
We observe that the general graphs with bounded interval number are sometimes called “split interval” [2], that may create some confusion.
- 3.
We refer to [13] for a more general presentation of range trees.
References
Abboud, A., Williams, V.V., Wang, J.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: SODA, pp. 377–391. SIAM (2016)
Bar-Yehuda, R., Halldórsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM J. Comput. 36(1), 1–15 (2006)
Bentley, J.H.: Decomposable searching problems. Inf. Process. Lett. 8(5), 244–251 (1979)
Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation. IMA, vol. 56, pp. 1–29. Springer, New York (1993). https://doi.org/10.1007/978-1-4613-8369-7_1
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)
Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. Electron. Notes Theor. Comput. Sci. 322, 51–67 (2016)
Borgatti, S., Everett, M.: Models of core/periphery structures. Soc. Netw. 21(4), 375–395 (2000)
Bousquet, N., Lagoutte, A., Li, Z., Parreau, A., Thomassé, S.: Identifying codes in hereditary classes of graphs and VC-dimension. SIAM J. Discrete Math. 29(4), 2047–2064 (2015)
Brandstädt, A., Chepoi, V., Dragan, F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discrete Appl. Math. 82(1–3), 43–77 (1998)
Brandstädt, A., Chepoi, V., Dragan, F.: Distance approximating trees for chordal and dually chordal graphs. J. Algorithms 30(1), 166–184 (1999)
Brandstädt, A., Dragan, F., Le, H., Le, V.: Tree spanners on chordal graphs: complexity and algorithms. Theoret. Comput. Sci. 310(1), 329–354 (2004)
Brandstädt, A., Hundt, C., Mancini, F., Wagner, P.: Rooted directed path graphs are leaf powers. Discrete Math. 310(4), 897–910 (2010)
Bringmann, K., Husfeldt, T., Magnusson, M.: Multivariate analysis of orthogonal range searching and graph distances parameterized by treewidth. In: IPEC (2018)
Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4(5), 467–489 (1989)
Chepoi, V., Dragan, F.: Disjoint sets problem (1992)
Corneil, D., Dragan, F., Habib, M., Paul, C.: Diameter determination on restricted graph families. Discrete Appl. Math. 113(2–3), 143–166 (2001)
Dourisboure, Y., Gavoille, C.: Improved compact routing scheme for chordal graphs. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 252–264. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36108-1_17
Dragan, F.: Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms 57(1), 1–21 (2005)
Ducoffe, G.: A new application of orthogonal range searching for computing giant graph diameters. In: 2nd Symposium on Simplicity in Algorithms (SOSA 2019) (2019)
Ducoffe, G., Habib, M., Viennot, L.: Diameter computation on \(H\)-minor free graphs and graphs of bounded (distance) VC-dimension. Technical report 1907.04385 arXiv (2019)
Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43(2–3), 173–189 (1983)
Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)
Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci. 234(1–2), 59–84 (2000)
Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1–2), 87–108 (2007)
McGuigan, R.: Presentation at NSF-CBMS Conference at Colby College (1977)
Olariu, S.: A simple linear-time algorithm for computing the center of an interval graph. Int. J. Comput. Math. 34(3–4), 121–128 (1990)
Roditty, L., Williams, V.V.: Fast approximation algorithms for the diameter and radius of sparse graphs. In: STOC, pp. 515–524. ACM (2013)
Scheinerman, E., West, D.: The interval number of a planar graph: three intervals suffice. J. Comb. Theory, Series B 35(3), 224–239 (1983)
Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566–579 (1984)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Ducoffe, G., Habib, M., Viennot, L. (2019). Fast Diameter Computation Within Split Graphs. In: Li, Y., Cardei, M., Huang, Y. (eds) Combinatorial Optimization and Applications. COCOA 2019. Lecture Notes in Computer Science(), vol 11949. Springer, Cham. https://doi.org/10.1007/978-3-030-36412-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-36412-0_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36411-3
Online ISBN: 978-3-030-36412-0
eBook Packages: Computer ScienceComputer Science (R0)