Eager st-ordering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 247-256

  Brandes, Ulrik ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

BICONNECTED COMPONENTS; DEPTH FIRST; DEPTH FIRST SEARCH; INCREMENTAL ALGORITHM; LINEAR TIME; ORDERING ALGORITHMS; PRE-PROCESSING STEP; SUBGRAPHS;

GRAPH THEORY;

EID: 38149060542     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45749-6_25     Document Type: Article

References (8)

1. J. Ebert. st-ordering the vertices of biconnected graphs. Computing, 30(1):19-33, 1983. 247, 248
2. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2(3):339-344, 1976. 247, 248
3. S. Even and R. E. Tarjan. Corrigendum: Computing an st-numbering. Theoretical Computer Science, 4(1):123, 1977. 247
4. H. N. Gabow. Path-based depth-first search for strong and biconnected components. Information Processing Letters, 74:107-114, 2000. 250
5. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In P. Rosenstiehl, editor, Proceedings ofthe International Symposium on the Theory of Graphs (Rome, July 1966), pages 215-232. Gordon and Breach, 1967. 248
6. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1973. 249, 250
7. R. E. Tarjan. Two streamlined depth-first search algorithms. Fundamenta In- formaticae, 9:85-94, 1986. 247, 248, 249, 255, 256
8. H. Whitney. Non-separable and planar graphs. Transactions of the American Mathematical Society, 34:339-362, 1932. 248