Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation
From MaRDI portal
Publication:5140740
DOI10.4230/LIPIcs.SEA.2018.29zbMath1493.68280arXiv1803.00927OpenAlexW2962695818MaRDI QIDQ5140740
Michal Ziobro, Marcin Pilipczuk
Publication date: 16 December 2020
Full work available at URL: https://arxiv.org/abs/1803.00927
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
Cites Work
- Graph minors. III. Planar tree-width
- Matching is as easy as matrix inversion
- Trimmed Moebius inversion and graphs of bounded degree
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- A Dynamic Programming Approach to Sequencing Problems
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Engineering Motif Search for Large Graphs
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
- Unnamed Item
- Unnamed Item
