Pages that link to "Item:Q3608837"
From MaRDI portal
The following pages link to An Improved Exact Algorithm for Cubic Graph TSP (Q3608837):
Displaying 24 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Finding and enumerating Hamilton cycles in 4-regular graphs (Q638522) (← links)
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- A new upper bound for the traveling salesman problem in cubic graphs (Q2250536) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Finding 2-factors closer to TSP tours in cubic graphs (Q2848544) (← links)
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs (Q2958106) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem (Q4326479) (← links)
- Cubic TSP: A 1.3-Approximation (Q4581212) (← links)
- (Q5090992) (← links)
- The Traveling Salesman Problem for Cubic Graphs (Q5301405) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Algorithms and Data Structures (Q5900763) (← links)