An approximation algorithm for finding long paths in Hamiltonian graphs
From MaRDI portal
Publication:4820883
Recommendations
- scientific article; zbMATH DE number 1445365
- Finding long paths and cycles in sparse Hamiltonian graphs
- On approximating the longest path in a graph
- An extension of the multi-path algorithm for finding Hamilton cycles
- An algorithm for finding Hamilton paths and cycles in random graphs
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- Algorithms for the optimal Hamiltonian path in Halin graphs
- On approximating the longest path in a graph
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
Cited in
(9)- scientific article; zbMATH DE number 1210362 (Why is no real title available?)
- scientific article; zbMATH DE number 2080243 (Why is no real title available?)
- A successful algorithm for solving directed Hamiltonian path problems
- On approximating the longest path in a graph
- Finding long paths and cycles in sparse Hamiltonian graphs
- scientific article; zbMATH DE number 1445365 (Why is no real title available?)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- On approximating the longest path in a graph
- Approximating long cycle above Dirac's guarantee
This page was built for publication: An approximation algorithm for finding long paths in Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820883)
