Edge-clique graphs and the l-coloring problem.
Tiziana CalamoneriRossella PetreschiPublished in: J. Braz. Comput. Soc. (2001)
Keyphrases
- undirected graph
- weighted graph
- maximum clique
- independent set
- directed graph
- edge information
- adjacency graph
- graph properties
- graph theory
- spanning tree
- special case
- maximum independent set
- quasi cliques
- minimum spanning trees
- complex networks
- minimum cost
- graph structure
- edge detection
- graph kernels
- maximum weight
- approximation algorithms
- structured data
- connected components
- random graphs
- graph matching
- maximal clique enumeration
- image processing
- graph clustering
- multiple scales
- graph data
- edge weights
- graph representation
- graph model