Extremal clique coverings of complementary graphs.
D. de CaenPaul ErdösNorman J. PullmannNicholas C. WormaldPublished in: Comb. (1986)
Keyphrases
- graph theory
- graph properties
- maximum independent set
- independent set
- maximum clique
- graph theoretic
- maximal clique enumeration
- quasi cliques
- graph matching
- graph mining
- rough sets
- data sets
- maximal cliques
- maximum weight
- directed graph
- special case
- neural network
- weighted graph
- series parallel
- structured objects
- search algorithm