Finding biconnected components in O(n) time for a class of graphs (Q1350120)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding biconnected components in O(n) time for a class of graphs |
scientific article; zbMATH DE number 983899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding biconnected components in O(n) time for a class of graphs |
scientific article; zbMATH DE number 983899 |
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
