Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees.

Ronald C. Read Robert E. Tarjan

Published in: Networks (1975)

Keyphrases

spanning tree
upper bound
worst case
optimization problems
computationally efficient
error bounds
minimum spanning tree
learning algorithm
lower bound
significant improvement
computational cost
theoretical analysis
times faster
data structure
randomized algorithms
worst case bounds