Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (Q4636504)
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: Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits |
scientific article; zbMATH DE number 6861955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits |
scientific article; zbMATH DE number 6861955 |
Statements
19 April 2018
0 references
biconnectivity
0 references
\(st\)-number
0 references
chain decomposition
0 references
tree cover
0 references
space efficient algorithms
0 references
read-only memory
0 references
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (English)
0 references
