A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
From MaRDI portal
Publication:3569745
DOI10.1007/978-3-642-13182-0_20zbMath1284.05292OpenAlexW1529355251MaRDI QIDQ3569745
Publication date: 22 June 2010
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_20
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Uses Software
This page was built for publication: A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem