Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs.
Konrad Kazimierz DabrowskiFrançois DrossDaniël PaulusmaPublished in: CoRR (2015)
Keyphrases
- maximum clique
- graph properties
- independent set
- graph theory
- graph theoretic
- quasi cliques
- series parallel
- maximal clique enumeration
- graph matching
- pattern recognition
- graph databases
- graph partitioning
- graph representation
- graph model
- graph data
- graph construction
- graph structure
- labeled graphs
- directed graph
- genetic algorithm
- maximum independent set
- neural network