Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (Q4636504): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.ISAAC.2016.22 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://arxiv.org/abs/1606.08645 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2463761753 / rank | |||
Normal rank | |||
| Property / title | |||
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (English) | |||
| Property / title: Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.ISAAC.2016.22 / rank | |||
Normal rank | |||
Latest revision as of 14:56, 30 December 2024
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
