Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs.

Published in: ISAAC (2) (2010)

Keyphrases

depth first search
breadth first search
search tree
routing problem
connected graphs
branch and bound
special case
spanning tree
tree search
parallel tree search
query processing
higher order
linear programming
closed form