A self-stabilizing algorithm for optimally efficient sets in graphs.
Sandra Mitchell HedetniemiStephen T. HedetniemiHao JiangKen KennedyAlice A. McRaePublished in: Inf. Process. Lett. (2012)
Keyphrases
- single pass
- preprocessing
- objective function
- learning algorithm
- improved algorithm
- computationally efficient
- cost function
- k means
- optimal solution
- neural network
- computational cost
- theoretical analysis
- high efficiency
- matching algorithm
- clustering method
- detection algorithm
- graph isomorphism
- expectation maximization
- high accuracy
- worst case
- experimental evaluation
- search space
- computational complexity
- probabilistic model
- dynamic programming
- significant improvement
- graph model
- graph clustering
- random graphs
- graph search
- hyper graph
- feature selection