Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract).
Daniel KoblerUdi RoticsPublished in: SODA (2001)
Keyphrases
- extended abstract
- optimization problems
- graph theory
- data structure
- benchmark problems
- test problems
- learning algorithm
- run times
- computational problems
- partial solutions
- search problems
- worst case
- problems in computer vision
- data mining
- maximum clique
- maximum independent set
- search methods
- combinatorial optimization
- data mining techniques
- search algorithm