Login / Signup

Path-based depth-first search for strong and biconnected components.

Harold N. Gabow
Published in: Inf. Process. Lett. (2000)
Keyphrases
  • depth first search
  • breadth first search
  • routing problem
  • iterative deepening
  • search tree
  • branch and bound
  • tree search
  • spanning tree
  • upper bound
  • orders of magnitude