Document Open Access Logo

Computing Paths of Large Rank in Planar Frameworks Deterministically

Authors Fedor V. Fomin , Petr A. Golovach , Tuukka Korhonen , Giannos Stamoulis

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2023.32.pdf
  • Filesize: 0.95 MB
  • 15 pages

Document Identifiers

Author Details

Fedor V. Fomin
  • Department of Informatics, University of Bergen, Norway
Petr A. Golovach
  • Department of Informatics, University of Bergen, Norway
Tuukka Korhonen
  • Department of Informatics, University of Bergen, Norway
Giannos Stamoulis
  • LIRMM, Université de Montpellier, CNRS, Montpellier, France

Funding

The research leading to these results has received funding from the Research Council of Norway via the project BWCA (grant no. 314528). Giannos Stamoulis acknowledges support by the ANR project ESIGMA (ANR-17-CE23-0010) and the French-German Collaboration ANR/DFG Project UTMA (ANR-20-CE92-0027).

Cite AsGet BibTex

Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Giannos Stamoulis. Computing Paths of Large Rank in Planar Frameworks Deterministically. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ISAAC.2023.32

Abstract

A framework consists of an undirected graph G and a matroid M whose elements correspond to the vertices of G. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing paths of rank k in frameworks. More precisely, for vertices s and t of G, and an integer k, they gave FPT algorithms parameterized by k deciding whether there is an (s,t)-path in G whose vertex set contains a subset of elements of M of rank k. These algorithms are based on Schwartz-Zippel lemma for polynomial identity testing and thus are randomized, and therefore the existence of a deterministic FPT algorithm for this problem remains open. We present the first deterministic FPT algorithm that solves the problem in frameworks whose underlying graph G is planar. While the running time of our algorithm is worse than the running times of the recent randomized algorithms, our algorithm works on more general classes of matroids. In particular, this is the first FPT algorithm for the case when matroid M is represented over rationals. Our main technical contribution is the nontrivial adaptation of the classic irrelevant vertex technique to frameworks to reduce the given instance to one of bounded treewidth. This allows us to employ the toolbox of representative sets to design a dynamic programming procedure solving the problem efficiently on instances of bounded treewidth.

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • Planar graph
  • longest path
  • linear matroid
  • irrelevant vertex

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Noga Alon, Raphael Yuster, and Uri Zwick. Color-coding. J. ACM, 42(4):844-856, 1995. URL: https://doi.org/10.1145/210332.210337.
  2. Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. In Proc. of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 951-970, 2020. URL: https://doi.org/10.1137/1.9781611975994.57.
  3. Andreas Björklund. Determinant sums for undirected hamiltonicity. SIAM J. Comput., 43(1):280-299, 2014. URL: https://doi.org/10.1137/110839229.
  4. Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci., 87:119-139, 2017. URL: https://doi.org/10.1016/j.jcss.2017.03.003.
  5. Andreas Björklund, Thore Husfeldt, and Nina Taslaman. Shortest cycle through specified elements. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1747-1753. SIAM, 2012. URL: https://doi.org/10.1137/1.9781611973099.139.
  6. Hajo Broersma, Xueliang Li, Gerhard J Woeginger, and Shenggui Zhang. Paths and cycles in colored graphs. Australas. J Comb., 31:299-312, 2005. Google Scholar
  7. Gruia Călinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput., 40(6):1740-1766, 2011. URL: https://doi.org/10.1137/080733991.
  8. Chandra Chekuri and Martin Pál. A recursive greedy algorithm for walks in directed graphs. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 245-253. IEEE Computer Society, 2005. Google Scholar
  9. Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, and Hong Phong Pham. Tropical paths in vertex-colored graphs. J. Comb. Optim., 42(3):476-498, 2021. URL: https://doi.org/10.1007/s10878-019-00416-y.
  10. Basile Couëtoux, Elie Nakache, and Yann Vaxès. The maximum labeled path problem. Algorithmica, 78(1):298-318, 2017. URL: https://doi.org/10.1007/s00453-016-0155-6.
  11. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Micha14 Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  12. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
  13. Eduard Eiben, Tomohiro Koana, and Magnus Wahlström. Determinantal sieving. CoRR, abs/2304.02091, 2023. URL: https://doi.org/10.48550/arXiv.2304.02091.
  14. Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, and Giannos Stamoulis. Shortest cycles with monotone submodular costs. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 2214-2227. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch83.
  15. Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, and Giannos Stamoulis. Fixed-parameter tractability of maximum colored path and beyond. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 3700-3712. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch142.
  16. Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Giannos Stamoulis. Computing paths of large rank in planar frameworks deterministically. CoRR, abs/2305.01993, 2023. URL: https://doi.org/10.48550/arXiv.2305.01993.
  17. Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos. Modification to Planarity is Fixed Parameter Tractable. In Proc. of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 126 of Leibniz International Proceedings in Informatics (LIPIcs), pages 28:1-28:17, Dagstuhl, Germany, 2019. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.STACS.2019.28.
  18. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh. Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM, 63(4):29:1-29:60, 2016. URL: https://doi.org/10.1145/2886094.
  19. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi. Hitting topological minors is FPT. In Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 1317-1326. ACM, 2020. URL: https://doi.org/10.1145/3357713.3384318.
  20. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos. Linear kernels for (connected) dominating set on H-minor-free graphs. In Proc. of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 82-93, 2012. URL: https://doi.org/10.1137/1.9781611973099.7.
  21. Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, and Dimitrios M. Thilikos. The parameterized complexity of graph cyclability. SIAM J. Discret. Math., 31(1):511-541, 2017. Google Scholar
  22. Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos. Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 3684-3699. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch141.
  23. Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, and Paul Wollan. Finding topological subgraphs is fixed-parameter tractable. In Proc. of the 43rd ACM Symposium on Theory of Computing (STOC), pages 479-488. ACM, 2011. URL: https://doi.org/10.1145/1993636.1993700.
  24. Bart M. P. Jansen, Jari J. H. de Kroon, and Michal W14odarczyk. Vertex deletion parameterized by elimination distance and even less. In Proc. of the 53rd Annual ACM Symposium on Theory of Computing (STOC), pages 1757-1769, 2021. URL: https://doi.org/10.1145/3406325.3451068.
  25. Ken-ichi Kawarabayashi. An improved algorithm for finding cycles through elements. In 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 5035 of Lecture Notes in Computer Science, pages 374-384. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-68891-4_26.
  26. Ken-ichi Kawarabayashi. Planarity allowing few error vertices in linear time. In Proc. of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 639-648, 2009. URL: https://doi.org/10.1109/FOCS.2009.45.
  27. Ken-ichi Kawarabayashi, Stephan Kreutzer, and Bojan Mohar. Linkless and flat embeddings in 3-space and the unknot problem. In Proc. of the 2010 Annual Symposium on Computational Geometry (SoCG), pages 97-106. ACM, 2010. URL: https://doi.org/10.1145/1810959.1810975.
  28. Ken-ichi Kawarabayashi, Bojan Mohar, and Bruce A. Reed. A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width. In Proc. of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 771-780, 2008. URL: https://doi.org/10.1109/FOCS.2008.53.
  29. Ken-ichi Kawarabayashi and Bruce A. Reed. Hadwiger’s conjecture is decidable. In Proc. of the 41st Annual ACM Symposium on Theory of Computing (STOC), pages 445-454, 2009. URL: https://doi.org/10.1145/1536414.1536476.
  30. Ken-ichi Kawarabayashi and Bruce A. Reed. Odd cycle packing. In Proc. of the 42nd ACM Symposium on Theory of Computing (STOC), pages 695-704, 2010. URL: https://doi.org/10.1145/1806689.1806785.
  31. Jon M. Kleinberg. Decision algorithms for unsplittable flow and the half-disjoint paths problem. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC), pages 530-539. ACM, 1998. Google Scholar
  32. Yusuke Kobayashi and Ken-ichi Kawarabayashi. Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. In Proc. of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1146-1155. ACM-SIAM, 2009. URL: https://dl.acm.org/doi/10.5555/1496770.1496894.
  33. Tuukka Korhonen. A single-exponential time 2-approximation algorithm for treewidth. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 184-192. IEEE, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00026.
  34. Ioannis Koutis. Faster algebraic algorithms for path and packing problems. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming - Volume Part I, ICALP '08, pages 575-586, Berlin, Heidelberg, 2008. Springer-Verlag. URL: https://doi.org/10.1007/978-3-540-70575-8_47.
  35. Ioannis Koutis and Ryan Williams. Algebraic fingerprints for faster algorithms. Commun. ACM, 59(1):98-105, December 2015. URL: https://doi.org/10.1145/2742544.
  36. Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, and Saket Saurabh. Deterministic truncation of linear matroids. ACM Trans. Algorithms, 14(2):14:1-14:20, 2018. URL: https://doi.org/10.1145/3170444.
  37. L. Lovász. Flats in matroids and geometric graphs. In Combinatorial surveys (Proc. Sixth British Combinatorial Conf., Royal Holloway Coll., Egham, 1977), pages 45-86, 1977. Google Scholar
  38. L. Lovász and M. D. Plummer. Matching theory, volume 121 of North-Holland Mathematics Studies. North-Holland Publishing Co., Amsterdam; North-Holland Publishing Co., Amsterdam, 1986. Annals of Discrete Mathematics, 29. Google Scholar
  39. László Lovász. Graphs and geometry, volume 65 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2019. URL: https://doi.org/10.1090/coll/065.
  40. Dániel Marx and Ildikó Schlotter. Obtaining a planar graph by vertex deletion. Algorithmica, 62(3-4):807-822, 2012. URL: https://doi.org/10.1007/s00453-010-9484-z.
  41. George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Math. Program., 14(1):265-294, 1978. URL: https://doi.org/10.1007/BF01588971.
  42. Neil Robertson and Paul D. Seymour. Graph minors XIII. The disjoint paths problem. J. Comb. Theory, Ser. B, 63(1):65-110, 1995. URL: https://doi.org/10.1006/jctb.1995.1006.
  43. Neil Robertson, Paul D. Seymour, and Robin Thomas. Quickly excluding a planar graph. J. Comb. Theory, Ser. B, 62(2):323-348, 1994. URL: https://doi.org/10.1006/jctb.1994.1073.
  44. Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos. k-apices of minor-closed graph classes. II. Parameterized algorithms. ACM Transactions on Algorithms, 18(3), 2022. URL: https://doi.org/10.1145/3519028.
  45. Magnus Wahlström. Abusing the Tutte matrix: An algebraic instance compression for the K-set-cycle problem. In Natacha Portier and Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, volume 20 of LIPIcs, pages 341-352. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. URL: https://doi.org/10.4230/LIPIcs.STACS.2013.341.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact