Bounding Clique-Width via Perfect Graphs.

Konrad K. Dabrowski Shenwei Huang Daniël Paulusma

Published in: CoRR (2014)

Keyphrases

maximum clique
graph properties
independent set
upper bound
quasi cliques
maximum independent set
graph matching
graph mining
graph theoretic
graph partitioning
structured objects
random graphs
database
graph databases
graph structure
series parallel
spanning tree
pairwise
dynamic graph
data mining
data sets