Disjoint clique cutsets in graphs without long holes.
Elaine M. EschenChính T. HoàngMark D. T. PetrickR. SritharanPublished in: J. Graph Theory (2005)
Keyphrases
- independent set
- maximum clique
- graph properties
- graph theory
- graph theoretic
- pairwise
- graph matching
- quasi cliques
- directed graph
- graph model
- maximum weight
- subgraph isomorphism
- graph databases
- maximal clique enumeration
- maximum independent set
- complex structures
- bipartite graph
- maximal cliques
- data sets
- graph structure
- special case
- image segmentation
- social networks