Abstract
Biró et al. (Discrete. Math 100(1–3):267–279, 1992) introduced the concept of H-graphs, intersection graphs of connected subgraphs of a subdivision of a graph H. They are related to and generalize many important classes of geometric intersection graphs, e.g., interval graphs, circular-arc graphs, split graphs, and chordal graphs. Our paper starts a new line of research in the area of geometric intersection graphs by studying several classical computational problems on H-graphs: recognition, graph isomorphism, dominating set, clique, and colorability. We negatively answer the 25-year-old question of Biró, Hujter, and Tuza which asks whether H-graphs can be recognized in polynomial time, for a fixed graph H. We prove that it is \(\textsf {NP}\)-complete if H contains the diamond graph as a minor. On the positive side, we provide a polynomial-time algorithm recognizing T-graphs, for each fixed tree T. For the special case when T is a star \(S_d\) of degree d, we have an \(\mathcal{O}(n^{3.5})\)-time algorithm. We give \(\textsf {FPT}\)- and \(\textsf {XP}\)-time algorithms solving the minimum dominating set problem on \(S_d\)-graphs and H-graphs, parametrized by d and the size of H, respectively. The algorithm for H-graphs adapts to an \(\textsf {XP}\)-time algorithm for the independent set and the independent dominating set problems on H-graphs. If H contains the double-triangle as a minor, we prove that the graph isomorphism problem is GI-complete and that the clique problem is APX-hard. On the positive side, we show that the clique problem can be solved in polynomial time if H is a cactus graph. Also, when a graph has a Helly H-representation, the clique problem is polynomial-time solvable. Further, we show that both the k-clique and the list k-coloring problems are solvable in FPT-time on H-graphs, parameterized by k and the treewidth of H. In fact, these results apply to classes of graphs with treewidth bounded by a function of the clique number. We observe that H-graphs have at most \(n^{O(\Vert H\Vert )}\) minimal separators which allows us to apply the meta-algorithmic framework of Fomin, Todinca, and Villanger (2015) to show that for each fixed t, finding a maximum induced subgraph of treewidth t can be done in polynomial time. In the case when H is a cactus, we improve the bound to \(O(\Vert H\Vert n^2)\).
Similar content being viewed by others
Notes
where each node of T corresponds to a maximal clique of G
The diamond graph is obtained by deleting an edge from a 4-vertex clique.
While the representation of a vertex of \(G_{\mathcal{P}}\) might “reach out” beyond \(D^*\) onto an incident edge, it can never traverse all of such an edge because, by Lemma 3.1, there is a vertex \(x_e\) of \(H_3\) occupying the “middle” of that edge and, by construction, \(x_e\) is not adjacent to any vertex of \(G_{\mathcal{P}}\).
Note that this is just a representational convenience for dynamic programming.
i.e., minimum feedback vertex set
References
Agaoglu, D., Hlinený, P.: Isomorphism problem for s\_d-graphs. In: Esparza, J., Daniel, K (eds) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24–28, 2020, Prague, Czech Republic, volume 170 of LIPIcs, pp. 4:1–4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c\({}^{{\rm k}}\) n 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317–378 (2016)
Biró, M., Hujter, M., Tuza, Z.: Precoloring extension. I. Interval graphs. Discrete. Math. 100(1–3), 267–279 (1992)
Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191–199 (1982)
Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335–379 (1976)
Bonomo, F., Mattia, S., Oriolo, G.: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45), 6261–6268 (2011)
Brady, M.L., Sarrafzadeh, M.: Stretching a knock-knee layout for multilayer wiring. IEEE Trans. Comput. 39(1), 148–151 (1990)
Bouchitté, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212–232 (2001)
Chlebík, M., Chlebíková, J.: The complexity of combinatorial optimization problems on d-dimensional boxes. SIAM J. Discrete Math. 21(1), 158–169 (2007)
Cameron, K., Chaplick, S., Hoàng, C.T.: On the structure of (pan, even hole)-free graphs. J. Graph Theory 87(1), 108–129 (2018)
Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press (2012)
Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Dániel, M., Michal, P., Saket, S.: Parameterized Algorithms. Springer, Marcin, Pilipczuk (2015)
Chang, M.-S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27(6), 1671–1694 (1998)
Curtis, A.R., Lin, M.C., McConnell, R.M., Nussbaum, Y., Soulignac, F.J., Spinrad, J.P., Szwarcfiter, J.L.: Isomorphism of graph classes related to the circular-ones property. Discrete Math. Theor. Comput. Sci. 15(1), 157–182 (2013). arXiv:1203.4822
Chaplick, S., Stacho, J.: The vertex leafage of chordal graphs. Discret. Appl. Math. 168, 14–25 (2014)
Chaplick, S., Toepfer, M., Voborník, J., Zeman, P.: On H-topological intersection graphs. In: Hans, L.B. Gerhard, J.W. (eds.) Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017, Revised Selected Papers, Volume 10520 of Lecture Notes in Computer Science, pp. 167–179. Springer (2017)
Chaplick, S., Zeman, P.: Combinatorial problems on H-graphs. Electron. Notes Discret. Math. 61, 223–229 (2017)
Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discret. Math. 18(3), 501–511 (2004)
Enright, J., Stewart, L., Tardos, G.: On list coloring and list homomorphism of permutation and interval graphs. SIAM J. Discrete Math. 28(4), 1675–1685 (2014)
Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835–855 (1965)
Francis, M.C., Gonçalves, D., Ochem, P.: The maximum clique problem in multiple interval graphs. Algorithmica 71(4), 812–836 (2013)
Fomin, F.V., Golovach, P.A., Raymond, J.-F.: On the tractability of optimization problems on \(H\)-graphs. Algorithmica 82(9), 2432–2473 (2020)
Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54–87 (2015)
Fulkerson, D.R.: Note on Dilworth’s decomposition theorem for partially ordered sets. Proc. Am. Math. Soc. 7, 701–702 (1956)
Gavril, F.: Algorithms on circular-arc graphs. Networks 4(4), 357–369 (1974)
Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47–56 (1974)
Gavril, F.: Intersection graphs of Helly families of subtrees. Discrete Appl. Math. 66(1), 45–56 (1996)
Gaspers, S., Mackenzie, S.: On the number of minimal separators in graphs. J. Graph Theory 87(4), 653–659 (2018)
Golumbic, M.C.: The complexity of comparability graph recognition and coloring. Computing 18(3), 199–208 (1977)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect graphs, vol. 57. Elsevier (2004)
Hopcroft, J.E., Karp, R.M.: An n\({}^{\text{5/2 }}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)
Huson, M.L., Sen, A.: Broadcast scheduling algorithms for radio networks. In: Proceedings of MILCOM ’95, volu. 2, pp. 647–651 (1995)
Habib, M., Stacho, J.: Reduced clique graphs of chordal graphs. Eur. J. Comb. 33(5), 712–735 (2012)
Hsu, W.-L.: Maximum weight clique algorithms for circular-arc graphs and circle graphs. SIAM J. Comput. 14(1), 224–231 (1985)
Jaffke, L., Kwon, O.-J., Telle, J.A.: Mim-width II. the feedback vertex set problem. Algorithmica 82(1), 118–145 (2020)
Joseph, D., Meidanis, J., Tiwari, P.: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. In: Otto, N., Esko, U. (eds.) Algorithm Theory - SWAT ’92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8—10, 1992, Proceedings, volume 621 of Lecture Notes in Computer Science, pp. 326–337. Springer (1992)
Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discret. Appl. Math. 75(2), 135–155 (1997)
Klavík, P., Kratochvíl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576, 85–101 (2015)
Kloks, T., Kratsch, D., Wong, C.K.: Minimum fill-in on circle and circular-arc graphs. J. Algorithms 28(2), 272–289 (1998)
Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. J. ACM 26(2), 183–195 (1979)
Mannino, C., Oriolo, G., Ricci-Tersenghi, F., Chandran, L.S.: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1), 1–9 (2007)
Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Torben, H., Jyrki, K. (eds.) Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8–10, 2004, Proceedings, Volume 3111 of Lecture Notes in Computer Science, pp. 260–272. Springer (2004)
Roberts, F.: S: Graph Theory and Its Applications to Problems of Society. SIAM (1978)
Robertson, N.S., Paul, D.: Graph minors. III. planar tree-width. J. Comb. Theory Ser. B 36(1), 49–64 (1984)
Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266–283 (1976)
Sinden, F.W.: Topology of thin film RC circuits. Bell Syst. Tech. J. 45(9), 1639–1662 (1966)
Tarjan, R.E.: Decomposition by clique separators. Discret. Math. 55(2), 221–232 (1985)
Whitesides, S.H.: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. In: Topics on Perfect Graphs., pp. 281–298, 1984. Annals of Discrete Mathematics 21
Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3(3), 351–358 (1982)
Acknowledgements
We would like to thank Pavel Klavík for suggesting to study of H-graphs and for several helpfull discussions. We would also like to thank the DIMACS REU 2015 program, held at the Rutgers University, where the whole project started.
Funding
P. Zeman: Supported by GAUK 1224120 and by GAČR 19-17314J.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chaplick, S., Töpfer, M., Voborník, J. et al. On H-Topological Intersection Graphs. Algorithmica 83, 3281–3318 (2021). https://doi.org/10.1007/s00453-021-00846-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-021-00846-3