Clique-Width for Graph Classes Closed under Complementation.
Alexandre BlanchéKonrad K. DabrowskiMatthew JohnsonVadim V. LozinDaniël PaulusmaVictor ZamaraevPublished in: CoRR (2017)
Keyphrases
- maximum weight
- graph properties
- maximum clique
- bipartite graph
- random walk
- independent set
- equivalence classes
- graph theoretic
- quasi cliques
- graph model
- graph representation
- maximal clique enumeration
- learning algorithm
- maximal cliques
- directed acyclic graph
- graph structure
- graph theory
- structured data
- maximum independent set
- graph partitioning
- graph databases
- graph mining
- random graphs
- graph based algorithm
- weighted graph
- np complete