Bounding the Clique-Width of H-free Chordal Graphs.

Andreas Brandstädt Konrad K. Dabrowski Shenwei Huang Daniël Paulusma

Published in: MFCS (2) (2015)

Keyphrases

independent set
undirected graph
maximum clique
graph properties
quasi cliques
graph theoretic
graph matching
upper bound
graph structure
weighted graph
graph mining
spanning tree
bipartite graph
graph kernels
maximum weight
directed graph
graph theory
graph representation
graph construction
real time