A linear time algorithm for minimum augmentation to 3-connect specified vertices of a graph

The subject of the paper is the 3-vertex-connectivity augmentation problem for a specified set of vertices (3VCA-SV), which is defined as follows: given an undirected graph G=(V, E) and a specified subset S of V with |S|>3, find a smallest set of edges to be added to G so that the resulting graph...

Full description

Saved in:
Bibliographic Details
Published in:1997 IEEE International Symposium on Circuits and Systems Vol. 2; pp. 1013 - 1016 vol.2
Main Authors: Mashima, T., Watanabe, T.
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 22.11.2002
Subjects:
Approximation algorithms
Circuits and systems
Ice
Polynomials
Systems engineering and theory
ISBN:9780780335837, 078033583X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The subject of the paper is the 3-vertex-connectivity augmentation problem for a specified set of vertices (3VCA-SV), which is defined as follows: given an undirected graph G=(V, E) and a specified subset S of V with |S|>3, find a smallest set of edges to be added to G so that the resulting graph may have the property that, even after deleting any two vertices from it, there is a path between any pair of remaining vertices in S. The result of the paper is that 3VCA-SV can be solved optimally in linear time.
ISBN:9780780335837
078033583X
DOI:10.1109/ISCAS.1997.621905