On the minimum local-vertex-connectivity augmentation in graphs (Q1406041)
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 1977912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum local-vertex-connectivity augmentation in graphs |
scientific article; zbMATH DE number 1977912 |
Statements
On the minimum local-vertex-connectivity augmentation in graphs (English)
0 references
9 September 2003
0 references
graph algorithms
0 references
connectivity
0 references
NP-hard
0 references
block-cut tree
0 references
cut-vertex
0 references
approximation algorithms
0 references
0.9236198663711548
0 references
0.8805954456329346
0 references
0.8673652410507202
0 references
