An algorithm for finding factorizations of complete graphs.
Anthony J. W. HiltonMatthew JohnsonPublished in: J. Graph Theory (2003)
Keyphrases
- computational complexity
- times faster
- learning algorithm
- segmentation algorithm
- preprocessing
- improved algorithm
- graph structure
- experimental evaluation
- matching algorithm
- detection algorithm
- theoretical analysis
- simulated annealing
- optimal solution
- input data
- minimum spanning tree
- convergence rate
- maximum clique
- adjacency graph
- clustering method
- high accuracy
- dynamic programming
- cost function
- search space
- objective function
- similarity measure
- social networks