Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.
Bruno CourcelleJohann A. MakowskyUdi RoticsPublished in: WG (1998)
Keyphrases
- optimization problems
- evolutionary algorithm
- bounded treewidth
- independent set
- np complete
- cost function
- graph properties
- maximum clique
- special case
- graph theoretic
- objective function
- quasi cliques
- np hard
- metaheuristic
- maximum independent set
- graph representation
- graph structure
- graph matching
- traveling salesman problem
- directed graph
- worst case
- computational complexity
- graph mining
- graph theory
- fixed parameter tractable
- neural network
- graph model
- complex structures
- graph structures
- subgraph isomorphism
- maximum weight
- combinatorial optimization