A data structure useful for finding Hamiltonian cycles

DOI10.1016/0304-3975(90)90053-KzbMath0694.68018MaRDI QIDQ909446

Adam Krawczyk, Tomasz Szymacha, Marek Chrobak

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclestreesreversalsdata structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Data structures and ejection chains for solving large-scale traveling salesman problems ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A \(k\)-level data structure for large-scale traveling salesman problems ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Sorting signed permutations by reversals, revisited ⋮ Implementation analysis of efficient heuristic algorithms for the traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian circuits in random graphs
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs

This page was built for publication: A data structure useful for finding Hamiltonian cycles