Abstract
Chordal graphs are intersection graphs of subtrees of a tree, while interval graphs are intersection graphs of subpaths of a path. Undirected path graphs are an intermediate class of graphs, defined as the intersection graphs of paths of a tree. It is known that Dominating Set, Connected Dominating Set, and Steiner Tree are \(\mathsf {W}[2]\)-hard on chordal graphs, when parameterized by the size of the solution, and are polynomial-time solvable on interval graphs. As for the undirected path graphs, all these problems are known to be \(\mathsf {NP}\)-complete, and when parameterized by the size of the solution, no classification in the parameterized complexity theory is known apart from the trivial \(\mathsf {XP}\) classification. We prove that Dominating Set, Connected Dominating Set, and Steiner Tree are \(\mathsf {FPT}\) for undirected path graphs when parameterized by the size of the solution, and that they continue to be \(\mathsf {FPT}\) for general chordal graphs when parameterized by the size of the solution plus the vertex leafage of the graph, provided a tree model with optimal vertex leafage is given. We show a relation between the parameterization of Min-LC-VSP problems by the leafage of the graph versus the vertex leafage plus the size of a solution.
This study was financed in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001, CNPq grants 140399/2017-8, 407635/2018-1, and 303803/2020-7, FAPERJ grant E-26/202.793/2017, STIC-AMSUD 88881.197438/2018-01, and FUNCAP/CNPq PNE-0112-00061.01.00/16.
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
References
Babel, L., Ponomarenko, I.N., Tinhofer, G.: The isomorphism problem for directed path graphs and for rooted directed path graphs. J. Algorithms 21(3), 542–564 (1996)
Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. Theoret. Comput. Sci. 511, 54–65 (2013)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 67–74 (2007)
Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Technical report. CS-77-04, Computer Science Department, University of Waterloo, Waterloo, Ontario (1979)
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)
Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoret. Comput. Sci. 511, 66–76 (2013)
Chaplick, S., Stacho, J.: The vertex leafage of chordal graphs. Discret. Appl. Math. 168, 14–25 (2014)
Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
de Figueiredo, C.M.H., de Melo, A.A., Sasaki, D., Silva, A.: Revising Johnson’s table for the 21st century. Discrete Appl. Math. (2021). https://doi.org/10.1016/j.dam.2021.05.021
Fomin, F.V., Golovach, P.A., Raymond, J.F.: On the tractability of optimization problems on H-graphs. Algorithmica 89(2), 1–42 (2020)
Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discret. Math. 23(3), 211–227 (1978)
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.: A recognition algorithm for the intersection graphs of directed paths in directed trees. Discret. Math. 13(3), 237–249 (1975)
Goddard, W., Henning, M.A.: Independent domination in graphs: a survey and recent results. Discret. Math. 313(7), 839–854 (2013)
Habib, M., Stacho, J.: Polynomial-time algorithm for the leafage of chordal graphs. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 290–300. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04128-0_27
Jaffke, L., Kwon, O.J., Strømme, T.J.F., Telle, J.A.: Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796, 216–236 (2019)
Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 6(3), 434–451 (1985)
Lin, I.J., McKee, T.A., West, D.B.: The leafage of a chordal graph. Discussiones Mathematicae Graph Theory 18, 23–48 (1998)
Monma, C.L., Wei, V.K.: Intersection graphs of paths in a tree. J. Comb. Theory Ser. B 41(2), 141–181 (1986)
Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008)
Vatshelle, M.: New width parameters of graphs. Ph.D. thesis, The University of Bergen (2012)
White, K., Farber, M., Pulleyblank, W.: Steiner trees, connected domination and strongly chordal graphs. Networks 15, 109–124 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
de Figueiredo, C.M.H., Lopes, R., de Melo, A.A., Silva, A. (2022). Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. In: Mutzel, P., Rahman, M.S., Slamin (eds) WALCOM: Algorithms and Computation. WALCOM 2022. Lecture Notes in Computer Science(), vol 13174. Springer, Cham. https://doi.org/10.1007/978-3-030-96731-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-96731-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-96730-7
Online ISBN: 978-3-030-96731-4
eBook Packages: Computer ScienceComputer Science (R0)