Path-based depth-first search for strong and biconnected components
Information Processing Letters
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Algorithms for computing a parameterized st-orientation
Theoretical Computer Science
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Parameterized st-orientations of graphs: algorithms and experiments
GD'06 Proceedings of the 14th international conference on Graph drawing
Computer Science Review
A simple test on 2-vertex- and 2-edge-connectivity
Information Processing Letters
| Hi-index | 0.00 |
Given a biconnected graph G = (V, E) with edge {s, t} 驴 E, 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.