Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes.
Konrad K. DabrowskiVadim V. LozinDaniël PaulusmaPublished in: WG (2017)
Keyphrases
- maximum weight
- maximum clique
- equivalence classes
- graph properties
- partial order
- random walk
- directed graph
- independent set
- quasi cliques
- graph theory
- weighted graph
- graph structure
- maximal cliques
- connected components
- graph matching
- graph mining
- graph model
- graph representation
- graph theoretic
- clustering algorithm
- maximal clique enumeration
- directed acyclic graph
- bipartite graph
- pattern mining
- social network analysis
- class labels