Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).
Derek G. CorneilMichel HabibJean-Marc LanlignelBruce A. ReedUdi RoticsPublished in: LATIN (2000)
Keyphrases
- extended abstract
- object recognition
- independent set
- recognition accuracy
- recognition rate
- pattern recognition
- graph isomorphism
- polynomial time complexity
- quasi cliques
- action recognition
- computer vision
- bounded treewidth
- visual recognition
- image recognition
- special case
- np complete
- graph model
- graph matching
- automatic recognition
- recognition process
- maximum clique
- planar graphs
- handwritten characters
- social networks
- activity recognition
- human activities
- subgraph isomorphism
- graph theory
- partial occlusion
- recognition algorithm
- graph structure