How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.
Wolfgang EspelageFrank GurskiEgon WankePublished in: WG (2001)
Keyphrases
- np complete
- np hard
- bounded treewidth
- polynomial time complexity
- np hardness
- min sum
- maximum weight
- planar graphs
- maximum independent set
- approximation algorithms
- special case
- graph matching
- polynomially solvable
- bounded degree
- graph properties
- computationally challenging
- graph theoretic
- worst case
- directed graph
- bipartite graph
- graph theory
- graph structure
- graph model
- scheduling problem
- linear programming
- constraint satisfaction problems
- decision problems
- computationally hard
- weighted graph
- graph representation
- graph databases
- spanning tree
- finding the shortest path
- random graphs
- graph clustering
- graph isomorphism
- minimum cost
- graph search
- maximum clique
- graph partitioning
- computational complexity
- lower bound
- labeled graphs
- optimal solution
- series parallel
- adjacency matrix
- graph kernels
- greedy heuristic
- graph structures