| Presentation | 2000/4/26 A Linear Time Algorithm for the 3-Vertex-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones Toshiya Mashima, Toshimasa Watanabe, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | 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⊆V and a set of degree-changeable vertices D⊆V, find a smallest set of edges E′ such that the vertex-connectivity of S in (V, E∪E′) is at least k and E′⊆{(u, v)|u, v∈D}, where the vertex-connectivity of S in G is the minimum number of vertices whose deletion from G leaves either a graph that has at least two connected components each of which contains a vertex in S or a graph that contains only one vertex in S." We call any vertex in V-D a degree-unchangeable vertex of G. In this paper, we show that checking the existence of a solution and finding a solution to 3VCA(G, S, D) can be done in O(|V|+|E|) time. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | graph algorithms / augmentation problems / vertex-connectivity |
| Paper # | COMP2000-3 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2000/4/26(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Linear Time Algorithm for the 3-Vertex-Connectivity Augmentation Problem for Specified Vertices of a Graph with Degree-Unchangeable Ones |
| Sub Title (in English) | |
| Keyword(1) | graph algorithms |
| Keyword(2) | augmentation problems |
| Keyword(3) | vertex-connectivity |
| 1st Author's Name | Toshiya Mashima |
| 1st Author's Affiliation | Department of Computer Engineering, Faculty of Information Sciences, Hiroshima City University() |
| 2nd Author's Name | Toshimasa Watanabe |
| 2nd Author's Affiliation | Department of Circuits and Systems, Faculty of Engineering, Hiroshima University |
| Date | 2000/4/26 |
| Paper # | COMP2000-3 |
| Volume (vol) | vol.100 |
| Number (no) | 25 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |