On the minimum local-vertex-connectivity augmentation in graphs
type: Item
instance of: scholarly article
title: On the minimum local-vertex-connectivity augmentation in graphs
zbMATH Open document ID: 1032.05128
DOI: 10.1016/S0166-218X(02)00580-2
author: Hiroshi Nagamochi
author: Toshimasa Ishii
published in: Discrete Applied Mathematics
publication date: 2003-09-09T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1977912
zbMATH Keywords: graph algorithms
zbMATH Keywords: connectivity
zbMATH Keywords: NP-hard
zbMATH Keywords: block-cut tree
zbMATH Keywords: cut-vertex
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
cites work: Parallel concepts in graph theory
cites work: Graph connectivity and its augmentation: Applications of MA orderings
cites work: An approximation algorithm for minimum-cost vertex-connectivity problems
cites work: Depth-First Search and Linear Graph Algorithms
full work available at URL: s0166-218x(02)00580-2
OpenAlex ID: W2066003695
description: scientific article; zbMATH DE number 1977912