A data structure useful for finding Hamiltonian cycles
From MaRDI portal
Publication:909446
DOI10.1016/0304-3975(90)90053-KzbMath0694.68018MaRDI QIDQ909446
Marek Chrobak, Tomasz Szymacha, Adam Krawczyk
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
05C45: Eulerian and Hamiltonian graphs
Related Items
Ejection chain and filter-and-fan methods in combinatorial optimization, Sorting signed permutations by reversals, revisited, Data structures and ejection chains for solving large-scale traveling salesman problems, Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Cites Work