A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs.
Caterina De SimoneAnna GalluccioPublished in: COCOA (2008)
Keyphrases
- undirected graph
- learning algorithm
- graph structure
- spanning tree
- preprocessing
- weighted graph
- graph isomorphism
- adjacency graph
- directed graph
- random graphs
- similarity measure
- simulated annealing
- worst case
- dynamic programming
- expectation maximization
- graph clustering
- minimum spanning tree
- computational complexity
- graph theoretical
- search space
- hyper graph
- matching algorithm
- real world graphs
- polynomial time complexity
- attributed graphs
- graph search
- max cut
- graph databases
- graph mining
- graph theory
- graph matching
- connected components
- clustering method
- segmentation algorithm
- np complete
- image segmentation