Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs.

Andreas Brandstädt Suhail Mahfud Raffaele Mosca

Published in: CoRR (2016)

Keyphrases

independent set
maximum clique
graph properties
quasi cliques
graph matching
directed graph
graph theoretic
graph clustering
graph theory
graph model
graph representation
series parallel
bounded treewidth
edge weights
subgraph isomorphism
graph structures
pattern recognition
graph partitioning
np hard