Claw-free t-perfect graphs can be recognised in polynomial time.

Henning Bruhn Oliver Schaudt

Published in: CoRR (2013)

Keyphrases

graph isomorphism
polynomial time complexity
np complete
special case
bounded treewidth
graph matching
graph representation
computational complexity
graph theory
graph mining
planar graphs
query language
graph model
bounded degree
series parallel
graph clustering
complex structures
directed graph