Finding a Smallest Augmentation to Biconnect a Graph (Q3142584): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:30, 4 February 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
