Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes.
Konrad K. DabrowskiVadim V. LozinDaniël PaulusmaPublished in: CoRR (2017)
Keyphrases
- maximum weight
- graph properties
- graph theory
- equivalence classes
- independent set
- maximum clique
- maximum independent set
- partial order
- structured data
- random walk
- connected components
- graph model
- clique tree
- graph representation
- graph theoretic
- quasi cliques
- bipartite graph
- graph structure
- weighted graph
- neural network
- minimum weight
- graph mining
- graph databases
- directed acyclic graph
- directed graph
- xml documents
- lower bound