Partition into cliques for cubic graphs: Planar case, complexity and approximation.
Márcia R. CerioliLuérbio FariaTalita O. FerreiraCarlos A. J. MartinhonFábio ProttiBruce A. ReedPublished in: Discret. Appl. Math. (2008)
Keyphrases
- approximation error
- maximal cliques
- planar graphs
- graph theory
- graph structure
- weighted graph
- graph matching
- approximation algorithms
- increase in computational complexity
- graph model
- error bounds
- computational complexity
- approximation guarantees
- case based reasoning
- space complexity
- undirected graph
- image sequences
- clustering algorithm
- maximum clique
- social networks