Clique Graph Recognition Is NP-Complete.
Liliana AlcónLuérbio FariaCelina M. H. de FigueiredoMarisa GutierrezPublished in: WG (2006)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- object recognition
- recognition rate
- maximum weight
- randomly generated
- np hard
- maximum clique
- recognition algorithm
- graph representation
- computational complexity
- graph properties
- feature extraction
- automatic recognition
- constraint satisfaction problems
- random walk
- satisfiability problem
- pattern recognition
- graph matching
- recognition accuracy
- independent set
- preprocessing stage
- recognition process
- graph theory
- graph model
- phase transition
- directed graph
- connected components
- activity recognition
- directed acyclic graph
- weighted graph
- graph structure
- conjunctive queries
- clique tree
- quasi cliques