Finding biconnected components in O(n) time for a class of graphs (Q1350120)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding biconnected components in O(n) time for a class of graphs |
scientific article |
Statements
Finding biconnected components in O(n) time for a class of graphs (English)
0 references
27 February 1997
0 references
Algorithms
0 references
Biconnected component
0 references
Breadth-first search
0 references
