scientific article; zbMATH DE number 1445365
From MaRDI portal
Publication:4952685
Recommendations
- An approximation algorithm for finding long paths in Hamiltonian graphs
- 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
- 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
- An algorithm for finding Hamilton paths and cycles in random graphs
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
Cited in
(18)- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- The longest path problem is polynomial on cocomparability graphs
- The Longest Path Problem Is Polynomial on Interval Graphs
- Finding long paths and cycles in sparse Hamiltonian graphs
- scientific article; zbMATH DE number 3849265 (Why is no real title available?)
- scientific article; zbMATH DE number 5631939 (Why is no real title available?)
- scientific article; zbMATH DE number 1210362 (Why is no real title available?)
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- scientific article; zbMATH DE number 682567 (Why is no real title available?)
- scientific article; zbMATH DE number 2080243 (Why is no real title available?)
- An approximation algorithm for finding long paths in Hamiltonian graphs
- On approximating the longest path in a graph
- Automata, Languages and Programming
- The longest path problem has a polynomial solution on interval graphs
- On approximating the longest path in a graph
- A successful algorithm for solving directed Hamiltonian path problems
- Algorithms for long paths in graphs
- Algorithm for two disjoint long paths in 2-connected graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952685)
