research-article

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

Authors:

Michał Ziobro,

Marcin PilipczukAuthors Info & Claims

Journal of Experimental Algorithmics (JEA), Volume 24

Article No.: 2.7, Pages 1 - 18

https://doi.org/10.1145/3368631

Published: 10 December 2019 Publication History

Abstract

The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in graphs of bounded treewidth: graphs that can be sweeped with separators of bounded size. These efficient algorithms usually follow the dynamic programming paradigm.

In recent years, we have seen a rapid and quite unexpected development of involved techniques for solving various computational problems in graphs of bounded treewidth. One of the most surprising directions is the development of algorithms for connectivity problems that have only single-exponential dependency (i.e., 2^O(t)) on the treewidth in the running time bound, as opposed to slightly superexponential (i.e., 2^{O(t log t)}) stemming from more naive approaches. In this work, we perform a thorough experimental evaluation of these approaches in the context of one of the most classic connectivity problems, namely, HAMILTONIAN CYCLE.

References

[1]

[n.d.]. SageMath package. Retrieved from www.sagemath.org.

[2]

2018. Recent trends in kernelization: Theory and experimental evaluation—project website. (2018). Retrieved from http://kernelization-experiments.mimuw.edu.pl.

[3]

Richard Bellman. 1958. Combinatorial Processes and Dynamic Programming. Technical Report. Rand Corp., Santa Monica, CA.

[4]

Andreas Björklund. 2014. Determinant sums for undirected hamiltonicity. SIAM J. Comput. 43, 1 (2014), 280--299.

Digital Library

[5]

Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. 2010. Trimmed Moebius inversion and graphs of bounded degree. Theor. Comput. Syst. 47, 3 (2010), 637--654.

Digital Library

[6]

Andreas Björklund, Petteri Kaski, Lukasz Kowalik, and Juho Lauri. 2014. Engineering motif search for large graphs. In Proceedings of the 17th Workshop on Algorithm Engineering and Experiments (ALENEX’14). SIAM, 104--118.

[7]

Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, and Jesper Nederlof. 2015. Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243 (2015), 86--111.

Digital Library

[8]

Hajo Broersma, Fedor V. Fomin, Pim van’t Hof, and Daniël Paulusma. 2009. Fast exact algorithms for Hamiltonicity in claw-free graphs. In Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 44--53.

[9]

Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms. Springer.

[10]

Marek Cygan, Stefan Kratsch, and Jesper Nederlof. 2018. Fast Hamiltonicity checking via bases of perfect matchings. J. ACM 65, 3 (2018), 12:1--12:46.

Digital Library

[11]

Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Joham M. M. van Rooij, and Jakub Onufry Wojtaszczyk. 2011. Solving connectivity problems parameterized by treewidth in single exponential time. In Proceedings of the IEEE 52nd Symposium on Foundations of Computer Science (FOCS’11). IEEE, 150--159.

Digital Library

[12]

Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances A. Rosamond. 2017. The first parameterized algorithms and computational experiments challenge. In Proceedings of the LIPIcs-Leibniz International Proceedings in Informatics, Vol. 63. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

[13]

Holger Dell, Christian Komusiewicz, Nimrod Talmon, and Mathias Weller. 2017. The PACE 2017 parameterized algorithms and computational experiments challenge: The second iteration. IPEC (2017), 30:1--30:12.

[14]

Stefan Fafianie, Hans L. Bodlaender, and Jesper Nederlof. 2015. Speeding up dynamic programming with representative sets: An experimental evaluation of algorithms for Steiner tree on tree decompositions. Algorithmica 71, 3 (2015), 636--660.

Digital Library

[15]

Herbert Fleischner. 2014. Uniquely Hamiltonian graphs of minimum degree 4. J. Graph Theor. 75, 2 (2014), 167--177.

[16]

Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, and Stefan Rümmele. 2019. Turbocharging treewidth heuristics. Algorithmica 81, 2 (2019), 439--475.

Digital Library

[17]

Michael Haythorpe. 2018. FHCP challenge set: The first set of structurally difficult instances of the Hamiltonian cycle problem. Bull. ICA 83 (2018), 98--107. Retrieved from http://arxiv.org/abs/1902.10352; challenge set at http://fhcp.edu.au/fhcpcs.

[18]

Michael Held and Richard M. Karp. 1962. A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math. 10, 1 (1962), 196--210.

[19]

Derek A. Holton and Robert E. L. Aldred. 1999. Planar graphs, regular graphs, bipartite graphs, and Hamiltonicity. Austral. J. Combin. 20 (1999), 111--132. Retrieved from http://ajc.maths.uq.edu.au/pdf/20/ocr-ajc-v20-p111.pdf.

[20]

R. Isaacs. 1975. Infinite families of nontrivial trivalent graphs which are not Tait colorable. Amer. Math. Monthly 82 (1975), 221--239.

[21]

Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. 2018. Known algorithms on graphs of bounded treewidth are probably optimal. ACM Trans. Algor. 14, 2 (2018), 13:1--13:30.

[22]

Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. 2018. Slightly superexponential parameterized problems. SIAM J. Comput. 47, 3 (2018), 675--702.

[23]

Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 1 (1987), 105--113.

Digital Library

[24]

Neil Robertson and Paul D. Seymour. 1984. Graph minors. III. Planar tree-width. J. Combin. Theor., Series B 36, 1 (1984), 49--64.

[25]

John Sheehan. 1977. Graphs with exactly one Hamiltonian circuit. J. Graph Theor. 1, 1 (1977), 37--43.

[26]

J. Statz. 2015. Unium. Retrieved from http://www.kittehface.com/p/unium.html.

[27]

Ben Strasser. 2017. Computing tree decompositions with flowcutter: PACE 2017 submission. CoRR abs/1709.08949 (2017). Retrieved from http://arxiv.org/abs/1709.08949.

[28]

Johan M. M. van Rooij, Hans L. Bodlaender, and Peter Rossmanith. 2009. Dynamic programming on tree decompositions using generalised fast subset convolution. In Proceedings of the 17th European Symposium on Algorithms (ESA’09). Lecture Notes in Computer Science, Amos Fiat and Peter Sanders (Eds.), Vol. 5757. Springer, 566--577.

[29]

M. E. Watkins. 1969. A theorem on Tait colorings with an application to the generalized Petersen graphs. J. Combin. Theor. 6 (1969), 152--164.

[30]

Michał Ziobro and Marcin Pilipczuk. 2018. Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. Code repository. Retrieved from https://github.com/stalowyjez/hc_tw_experiments.

[31]

Michal Ziobro and Marcin Pilipczuk. 2018. Finding Hamiltonian cycle in graphs of bounded treewidth: Experimental evaluation. In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA’18). LIPIcs, Gianlorenzo D’Angelo (Ed.), Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 29:1--29:14.

Cited By

Mathieson LMoscato P(2020)The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise2020 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI47803.2020.9308295(2381-2390)Online publication date: 1-Dec-2020
https://doi.org/10.1109/SSCI47803.2020.9308295

Index Terms

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation
1. Theory of computation
  1. Design and analysis of algorithms
    1. Parameterized complexity and exact algorithms

Recommendations

Tree-coloring problems of bounded treewidth graphs
Abstract
This paper studies the parameterized complexity of the tree-coloring problem and equitable tree-coloring problem. Given a graph $G = (V, E)$ and an integer $r \geq 1$ , we give an FPT algorithm to decide whether there is a tree-r-coloring of graph G when ...
The parameterised complexity of list problems on graphs of bounded treewidth

We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromatic Number are fixed parameter tractable, parameterised by ...
A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

This paper concerns a domination problem in graphs with parity constraints. The task is to find a subset of the vertices with minimum cost such that for every vertex the number of chosen vertices in its neighbourhood has a prespecified parity. This ...

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics

ACM Journal of Experimental Algorithmics Volume 24, Issue

Special Issue ESA 2016, Regular Papers and Special Issue SEA 2018

2019

622 pages

ISSN:1084-6654

EISSN:1084-6654

DOI:10.1145/3310279

Issue’s Table of Contents

Copyright © 2019 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 December 2019

Accepted: 01 September 2019

Revised: 01 September 2019

Received: 01 September 2018

Published in JEA Volume 24

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Recent trends in kernelization: theory and experimental evaluation
European Union under the European Regional Development Fund
Homing programme of the Foundation for Polish Science

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
223
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)1

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mathieson LMoscato P(2020)The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise2020 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI47803.2020.9308295(2381-2390)Online publication date: 1-Dec-2020
https://doi.org/10.1109/SSCI47803.2020.9308295

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Issue’s Table of Contents