Optimal parallel coloring algorithms for a family of tree-representable graphs.

Rong Lin Stephan Olariu

Published in: ACM Conference on Computer Science (1991)

Keyphrases

graph theory
computational cost
data structure
computational complexity
worst case
computationally efficient
minimum spanning tree
b tree
spanning tree
binary search trees
bayesian networks
evolutionary algorithm
special case
dynamic programming
optimization problems
exhaustive search