Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.
Flavia BonomoGianpaolo OrioloClaudia SnelsGautier StaufferPublished in: IPCO (2013)
Keyphrases
- graph properties
- independent set
- maximum clique
- graph theoretic
- graph theory
- spanning tree
- directed graph
- quasi cliques
- connected dominating set
- minimum cost
- graph databases
- integer points
- dominating set
- neural network
- graph clustering
- square error
- maximum independent set
- maximal cliques
- graph construction
- random graphs
- minimum spanning tree
- graph data
- graph representation
- bipartite graph
- graph matching
- special case