Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation

DOI10.1145/3368631OpenAlexW2996558957WikidataQ126530690 ScholiaQ126530690MaRDI QIDQ4984872FDOQ4984872

Authors: Michal Ziobro, Marcin Pilipczuk 

Publication date: 21 April 2021

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3368631

Recommendations

• Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• On Exact Algorithms for Treewidth
• On exact algorithms for treewidth

zbMATH Keywords

bounded treewidthHamiltonian cycleexperimental evaluation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• A Dynamic Programming Approach to Sequencing Problems
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Parameterized algorithms
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Dynamic programming and stochastic control processes
• Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Matching is as easy as matrix inversion
• Graph minors. III. Planar tree-width
• Trimmed Moebius inversion and graphs of bounded degree
• Engineering Motif Search for Large Graphs
• Determinant sums for undirected Hamiltonicity
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
• Graphs with exactly one hamiltonian circuit
• Known algorithms on graphs of bounded treewidth are probably optimal
• Slightly superexponential parameterized problems
• Uniquely Hamiltonian graphs of minimum degree 4
• Title not available (Why is that?)
• Turbocharging treewidth heuristics
• FHCP challenge set: the first set of structurally difficult instances of the Hamiltonian cycle problem
• Fast exact algorithms for Hamiltonicity in claw-free graphs
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
• Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions

Cited In (3)

• Title not available (Why is that?)
• Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs

This page was built for publication: Finding Hamiltonian cycle in graphs of bounded treewidth. Experimental evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4984872)