A Processor Efficient Connectivity Algorithm on Random Graphs.

S. B. Yang Sudarshan K. Dhall S. Lakshmivarahan

Published in: Parallel Process. Lett. (1994)

Keyphrases

random graphs
dynamic programming
objective function
computational complexity
learning algorithm
optimal solution
k means
tree structure
multiprocessor systems
np hard
upper bound
worst case
spanning tree
graph theoretic
learning curves