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 the normal view instead:
scientific article; zbMATH DE number 6861955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9655210375785828
0 references
0.8860162496566772
0 references
0.876707136631012
0 references
0.8762040138244629
0 references
0.8312963843345642
0 references
