Connectivity of random regular graphs generated by the pegging algorithm.
Pu GaoPublished in: J. Graph Theory (2010)
Keyphrases
- detection algorithm
- experimental evaluation
- search space
- high accuracy
- k means
- matching algorithm
- computational complexity
- linear programming
- particle swarm optimization
- worst case
- dynamic programming
- clustering method
- randomly generated
- optimal solution
- recognition algorithm
- generation method
- adjacency graph
- graph isomorphism
- np hard
- cost function
- preprocessing
- graphical models
- computational cost
- times faster
- significant improvement
- phase transition
- graph structure
- minimum spanning tree
- data structure
- similarity measure
- neural network