Finding a Smallest Augmentation to Biconnect a Graph (Q3142584): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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://doi.org/10.1137/0222056 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015645763 / rank | |||
Normal rank | |||
Latest revision as of 22:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Smallest Augmentation to Biconnect a Graph |
scientific article |
Statements
Finding a Smallest Augmentation to Biconnect a Graph (English)
0 references
4 January 1994
0 references
graph augmentation
0 references
biconnected graph
0 references
poly-log time
0 references
linear-time algorithm
0 references
EREW PRAM
0 references
