Eager st-Ordering

  • Ulrik Brandes
Conference paper

DOI: 10.1007/3-540-45749-6_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2461)
Cite this paper as:
Brandes U. (2002) Eager st-Ordering. In: Möhring R., Raman R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg

Abstract

Given a biconnected graph G = (V,E) with edge s, tE, an st-ordering is an ordering v1, . . . , vn of V such that s = v1, t = vn, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ulrik Brandes
    • 1
  1. 1.Department of Computer & Information ScienceUniversity of KonstanzUSA

Personalised recommendations