Efficient implementation of graph algorithms using contraction.

Harold N. Gabow Zvi Galil Thomas H. Spencer

Published in: J. ACM (1989)

Keyphrases

efficient implementation
graph theory
active set
data structure
structured data
parallel architectures
highly parallel
np hard
belief revision
computational complexity
matrix factorization
hardware implementation
computationally intensive
spanning tree
efficient processing
graph search
learning algorithm