Login / Signup
Bounding Clique-Width via Perfect Graphs.
Konrad Kazimierz Dabrowski
Shenwei Huang
Daniël Paulusma
Published in:
LATA (2015)
Keyphrases
</>
independent set
graph properties
maximum clique
quasi cliques
upper bound
graph matching
graph theory
graph theoretic
data mining
maximum independent set
series parallel
graph model
directed graph
data sets
graph representation
graph databases
maximum weight
special case
search engine