Polynomial-time recognition of clique-width ≤3 graphs.
Derek G. CorneilMichel HabibJean-Marc LanlignelBruce A. ReedUdi RoticsPublished in: Discret. Appl. Math. (2012)
Keyphrases
- recognition rate
- object recognition
- maximum clique
- feature extraction
- graph isomorphism
- automatic recognition
- special case
- independent set
- recognition accuracy
- graph matching
- image recognition
- pattern recognition
- recognition algorithm
- action recognition
- computational complexity
- recognition process
- quasi cliques
- graph properties
- handwritten characters
- graph representation
- graph databases
- weighted graph
- graph theory
- branch and bound algorithm
- directed graph
- worst case