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