Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.
Andreas BrandstädtFeodor F. DraganEkkehard KöhlerPublished in: WG (1999)
Keyphrases
- optimization problems
- related problems
- benchmark problems
- graph theory
- problems in computer vision
- approximate solutions
- practical problems
- difficult problems
- combinatorial optimization
- test problems
- np complete
- learning algorithm
- worst case
- computational cost
- computational complexity
- data mining
- data mining techniques
- significant improvement
- graph theoretic
- search algorithm
- data structure
- exact algorithms
- random graphs
- computational geometry
- computational problems
- run times