Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
From MaRDI portal
Publication:1281769
DOI10.1016/S0166-218X(98)00071-7zbMath0927.68061OpenAlexW1970948540MaRDI QIDQ1281769
Lusheng Wang, Paul Stelling, Dan Gusfield, Richard M. Karp
Publication date: 22 March 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00071-7
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors ⋮ Euler circuits and DNA sequencing by hybridization ⋮ Method to solve the travelling salesman problem using the inverse of diffusion process
Cites Work
This page was built for publication: Graph traversals, genes and matroids: An efficient case of the travelling salesman problem