Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
Bruno CourcelleJohann A. MakowskyUdi RoticsPublished in: Theory Comput. Syst. (2000)
Keyphrases
- optimization problems
- maximum clique
- independent set
- evolutionary algorithm
- graph properties
- np complete
- cost function
- special case
- np hard
- graph theoretic
- bounded treewidth
- quasi cliques
- graph matching
- objective function
- computational complexity
- weighted graph
- traveling salesman problem
- optimization methods
- maximum weight
- maximal cliques
- bipartite graph
- graph partitioning
- graph theory
- directed graph
- metaheuristic
- worst case
- random graphs
- undirected graph
- social networks
- bounded degree
- maximal clique enumeration