Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms.

Michal Parnas Dana Ron

Published in: Theor. Comput. Sci. (2007)

Keyphrases

orders of magnitude
computationally efficient
recently developed
significant improvement
computational cost
neural network
learning algorithm
cooperative
search algorithm
peer to peer
theoretical analysis
benchmark datasets
data mining algorithms
computationally expensive
graph theory