Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:50, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits |
scientific article |
Statements
Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (English)
0 references
15 September 2017
0 references
depth-first search
0 references
DFS
0 references
space-efficient graph algorithms
0 references
biconnectivity
0 references
2-edge connectivity
0 references
\(st\)-numbering
0 references
sparse spanning biconnected subgraph
0 references
topological sort
0 references
lowpoint
0 references
