scientific article; zbMATH DE number 7559398
From MaRDI portal
Publication:5089192
DOI10.4230/LIPICS.MFCS.2020.27MaRDI QIDQ5089192FDOQ5089192
Authors: Argyrios Deligkas, George B. Mertzios, Victor Zamaraev, P. G. Spirakis 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2004.06036
Title of this publication is not available (Why is that?)
Recommendations
- The complexity of Thomason's algorithm for finding a second Hamiltonian cycle
- The complexity of finding a second Hamiltonian cycle in cubic graphs
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- Simple algorithm for finding a second Hamilton cycle
- scientific article; zbMATH DE number 2102640
- An algorithm for Hamiltonian cycles under implicit degree conditions.
- An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
- scientific article; zbMATH DE number 749660
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
Cites Work
- Reducibility among combinatorial problems
- A new upper bound for the traveling salesman problem in cubic graphs
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
- The traveling salesman problem in bounded degree graphs
- A Dynamic Programming Approach to Sequencing Problems
- The Traveling Salesman Problem for Cubic Graphs
- On the complexity of the parity argument and other inefficient proofs of existence
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Long cycles in Hamiltonian graphs
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Title not available (Why is that?)
- The complexity of finding a second Hamiltonian cycle in cubic graphs
- Recent advances on the Hamiltonian problem: survey III
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
- On Hamiltonian Circuits
- Fast Hamiltonicity checking via bases of perfect matchings
- Determinant sums for undirected Hamiltonicity
- Spanning cycles of nearly cubic graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089192)
