scientific article; zbMATH DE number 7559398
From MaRDI portal
Publication:5089192
DOI10.4230/LIPIcs.MFCS.2020.27MaRDI QIDQ5089192
Victor Zamaraev, George B. Mertzios, Argyrios Deligkas, Paul G. Spirakis
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2004.06036
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure
- Spanning cycles of nearly cubic graphs
- The complexity of finding a second Hamiltonian cycle in cubic graphs
- On the complexity of the parity argument and other inefficient proofs of existence
- Long cycles in Hamiltonian graphs
- A new upper bound for the traveling salesman problem in cubic graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Recent advances on the Hamiltonian problem: survey III
- The traveling salesman problem in bounded degree graphs
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- 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
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings
- Reducibility among Combinatorial Problems
- The Traveling Salesman Problem for Cubic Graphs
- Determinant Sums for Undirected Hamiltonicity
- On Hamiltonian Circuits
- Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
This page was built for publication:
