The Traveling Salesman Problem for Cubic Graphs
From MaRDI portal
Recommendations
Cited in
(38)- A travelling salesman problem in the \(k\)-dimensional unit cube
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Exact algorithms for finding longest cycles in claw-free graphs
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
- Switching 3-edge-colorings of cubic graphs
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
- A new upper bound for the traveling salesman problem in cubic graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Computing optimal Steiner trees in polynomial space
- An improved exact algorithm for TSP in graphs of maximum degree 4
- Finding 2-factors closer to TSP tours in cubic graphs
- A linear-size conversion of HCP to 3HCP
- A polynomial-space exact algorithm for TSP in degree-6 graphs
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
- Special frequency quadrilaterals and an application
- A new heuristic for detecting non-Hamiltonicity in cubic graphs
- Spotting trees with few leaves
- Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem
- On the minimum number of Hamiltonian cycles in regular graphs
- Two Algorithmic Results for the Traveling Salesman Problem
- On the traveling salesman problem in binary Hamming spaces
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
- scientific article; zbMATH DE number 7559398 (Why is no real title available?)
- Exploiting sparsity for bipartite Hamiltonicity
- On the number of Hamilton cycles in bounded degree graphs
- A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles
- Spotting trees with few leaves
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Parameterized traveling salesman problem: beating the average
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
- The traveling salesman problem for cubic graphs.
- The Asymmetric Travelling Salesman Problem In Sparse Digraphs.
- Finding and enumerating Hamilton cycles in 4-regular graphs
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals
- Approximate and randomized algorithms for computing a second Hamiltonian cycle
- Supereulerian testing on semi-Eulerian graphs
- Three value TSP and linkages with the three value linear spanning 2-forests
- Heuristic search for Hamilton cycles in cubic graphs
This page was built for publication: The Traveling Salesman Problem for Cubic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301405)
