A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs.
Xin HeYaacov YeshaPublished in: SIAM J. Comput. (1988)
Keyphrases
- parallel algorithm
- spanning tree
- planar graphs
- binary search trees
- minimum weight
- minimum cost
- edge disjoint
- worst case
- search tree
- parallel version
- optimal solution
- undirected graph
- depth first search
- dynamic programming
- cluster of workstations
- search space
- search algorithm
- minimum spanning tree
- weighted graph
- branch and bound algorithm
- branch and bound
- np hard
- data structure