A minimum 3-connectivity augmentation of a graph (Q1208926)
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: A minimum 3-connectivity augmentation of a graph |
scientific article; zbMATH DE number 167123
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimum 3-connectivity augmentation of a graph |
scientific article; zbMATH DE number 167123 |
Statements
A minimum 3-connectivity augmentation of a graph (English)
0 references
16 May 1993
0 references
minimum 3-connectivity augmentation
0 references
undirected simple graph
0 references
NP- complete
0 references
algorithm
0 references
