Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. J. Ebert. st-ordering the vertices of biconnected graphs. Computing, 30(1):19–33, 1983.
2. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2(3):339–344, 1976.
3. S. Even and R. E. Tarjan. Corrigendum: Computing an st-numbering. Theoretical Computer Science, 4(1):123, 1977.
4. H. N. Gabow. Path-based depth-first search for strong and biconnected components. Information Processing Letters, 74:107–114, 2000.
5. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In P. Rosenstiehl, editor, Proceedings of the International Symposium on the Theory of Graphs (Rome, July 1966), pages 215–232. Gordon and Breach, 1967.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献