Clique-width and well-quasi-ordering of triangle-free graph classes.

Konrad K. Dabrowski Vadim V. Lozin Daniël Paulusma

Published in: J. Comput. Syst. Sci. (2020)

Keyphrases

maximum weight
maximum clique
partial order
random walk
quasi cliques
graph properties
equivalence classes

maximal clique enumeration
graph theory
graph structure
graph representation
graph theoretic
independent set
graph databases

directed graph
maximal cliques
maximum independent set
connected components
graph model
dependency graph
bipartite graph

graph clustering
structured data
graph matching
bounded degree
shortest path
bayesian networks