Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time.
Henning BruhnOliver SchaudtPublished in: IPCO (2014)
Keyphrases
- graph isomorphism
- bounded treewidth
- polynomial time complexity
- approximation algorithms
- special case
- worst case
- np complete
- planar graphs
- graph matching
- computational complexity
- series parallel
- graph theoretic
- graph model
- graph representation
- weighted graph
- graph structures
- graph theory
- graph mining
- spanning tree
- graph structure
- graph data
- random graphs
- directed graph
- constraint satisfaction problems
- object recognition
- image segmentation