Abstract
The Disjoint Paths problem takes as input a graph and pairs of terminals, and asks whether all the terminal pairs can be connected by paths that are vertex disjoint. It is known to be NP-complete even on interval graphs. On general graphs, the framework of Robertson and Seymour can be used to get an FPT result parameterized by the number of terminals, but the running time is very high. Considering this, there has been a lot of work on Disjoint Paths on restricted graph classes like planar graphs, chordal graphs, etc.
In this work, we look at a generalization of the Disjoint Paths problem, namely Set-Restricted Disjoint Paths (SRDP), where in addition to terminal pairs, we are also given subsets of vertices as domains for each pair, and we want to connect the terminal pairs by vertex disjoint paths that use the vertices only from their respective domains. This problem is known to be in XP on chordal graphs. We show that the FPT result of Disjoint Paths on chordal graphs can be generalized to SRDP. In particular, we show that SRDP can be solved in time \({\mathcal {O}}^*(2^{{\mathcal {O}}(k \log k)})\) on chordal graphs (here the \({\mathcal {O}}^*\) notation hides the polynomial factors in the running time), where k is the number of terminal pairs. We complement this result by showing that SRDP does not have a polynomial kernel on interval graphs, a subclass of chordal graphs.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Adler, I., Kolliopoulos, S.G., Krause, P.K., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Irrelevant vertices for the planar disjoint paths problem. J. Comb. Theory Ser. B 122, 815–843 (2017). https://doi.org/10.1016/j.jctb.2016.10.001
Ahn, J., Jaffke, L., Kwon, O., Lima, P.T.: Well-partitioned chordal graphs: obstruction set and disjoint paths. In: Adler, I., Müller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 148–160. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-60440-0_12
Belmonte, R., Golovach, P.A., Heggernes, P., van ’t Hof, P., Kaminski, M., Paulusma, D.: Detecting fixed patterns in chordal graphs in polynomial time. Algorithmica 69(3), 501–521 (2014). https://doi.org/10.1007/s00453-013-9748-5
Blair, J.R., England, R.E., Thomason, M.G.: Cliques and their separators in triangulated graphs. University of Tennessee, USA (1988)
Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277–305 (2014)
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)
Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Hitting topological minors is FPT. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22–26 June 2020, pp. 1317–1326. ACM (2020). https://doi.org/10.1145/3357713.3384318
Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019). https://doi.org/10.1017/9781107415157
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Grohe, M., Kawarabayashi, K.I., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 479–488. Association for Computing Machinery, New York (2011). https://doi.org/10.1145/1993636.1993700
Kammer, F., Tholey, T.: The k-disjoint paths problem on chordal graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 190–201. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11409-0_17
Lokshtanov, D., Misra, P., Pilipczuk, M., Saurabh, S., Zehavi, M.: An exponential time parameterized algorithm for planar disjoint paths. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pp. 1307–1316. Association for Computing Machinery, New York (2020). https://doi.org/10.1145/3357713.3384250
Natarajan, S., Sprague, A.P.: Disjoint paths in circular arc graphs. Nordic J. Comput. 3(3), 256–270 (1996)
Robertson, N., Seymour, P.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65–110 (1995). https://doi.org/10.1006/jctb.1995.1006. https://www.sciencedirect.com/science/article/pii/S0095895685710064
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
Golovach, P.A., Panolan, F., Rai, A., Saurabh, S. (2022). Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. In: Kulikov, A.S., Raskhodnikova, S. (eds) Computer Science – Theory and Applications. CSR 2022. Lecture Notes in Computer Science, vol 13296. Springer, Cham. https://doi.org/10.1007/978-3-031-09574-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-09574-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09573-3
Online ISBN: 978-3-031-09574-0
eBook Packages: Computer ScienceComputer Science (R0)