The k-vertex-connectivity augmentation problem for a specified set of vertices of a graph with degree-unchangeable vertices, kVCA(G,S,D), is defined as follows: "Given a positive integer k, an undirected graph G=(V,E), a specified set of vertices S
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Toshiya MASHIMA, Toshimasa WATANABE, "Graph Augmentation Problems with Degree-Unchangeable Vertices" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 3, pp. 781-793, March 2001, doi: .
Abstract: The k-vertex-connectivity augmentation problem for a specified set of vertices of a graph with degree-unchangeable vertices, kVCA(G,S,D), is defined as follows: "Given a positive integer k, an undirected graph G=(V,E), a specified set of vertices S
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_3_781/_p
Copy
@ARTICLE{e84-a_3_781,
author={Toshiya MASHIMA, Toshimasa WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Graph Augmentation Problems with Degree-Unchangeable Vertices},
year={2001},
volume={E84-A},
number={3},
pages={781-793},
abstract={The k-vertex-connectivity augmentation problem for a specified set of vertices of a graph with degree-unchangeable vertices, kVCA(G,S,D), is defined as follows: "Given a positive integer k, an undirected graph G=(V,E), a specified set of vertices S
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Graph Augmentation Problems with Degree-Unchangeable Vertices
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 781
EP - 793
AU - Toshiya MASHIMA
AU - Toshimasa WATANABE
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2001
AB - The k-vertex-connectivity augmentation problem for a specified set of vertices of a graph with degree-unchangeable vertices, kVCA(G,S,D), is defined as follows: "Given a positive integer k, an undirected graph G=(V,E), a specified set of vertices S
ER -