Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
Michael U. GerberDaniel KoblerPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- optimization problems
- benchmark problems
- problems in computer vision
- graph theory
- computational problems
- data structure
- polynomial time complexity
- maximum clique
- partitioning algorithm
- np complete
- worst case
- computational complexity
- learning algorithm
- search methods
- combinatorial optimization
- graph structure
- search algorithm
- maximal clique enumeration