On the minimum local-vertex-connectivity augmentation in graphs (Q1406041): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph connectivity and its augmentation: Applications of MA orderings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximation algorithm for minimum-cost vertex-connectivity problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Revision as of 10:50, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimum local-vertex-connectivity augmentation in graphs |
scientific article |
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
