Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs.
Haiko MüllerFalk NicolaiPublished in: Inf. Process. Lett. (1993)
Keyphrases
- optimization problems
- polynomial time complexity
- computational complexity
- benchmark problems
- learning algorithm
- worst case
- graph theory
- planar graphs
- problems in computer vision
- data structure
- computational problems
- euclidean distance
- np complete
- real valued
- search methods
- combinatorial optimization
- special case
- run times
- polynomial hierarchy
- minimum cost flow
- lower bound