Algorithms — ESA 2002

Volume 2461 of the series Lecture Notes in Computer Science pp 247-256


Eager st-Ordering

  • Ulrik BrandesAffiliated withDepartment of Computer & Information Science, University of Konstanz

* Final gross prices may vary according to local VAT.

Get Access


Given a biconnected graph G = (V,E) with edge s, tE, an st-ordering is an ordering v 1, . . . , v n of V such that s = v 1, t = v n , and every other vertex has both a higher-numbered and a lower-numbered neighbor. Previous linear-time st-ordering algorithms are based on a preprocessing step in which depth-first search is used to compute lowpoints. The actual ordering is determined only in a second pass over the graph. We present a new, incremental algorithm that does not require lowpoint information and, throughout a single depth-first traversal, maintains an st-ordering of the biconnected component of s, t in the traversed subgraph.