Presentation 2002/5/17
Source Location Problem with Local 3-Vertex-Connectivity Requirements
Hitoshi FUJITA, Toshimasa ISHII, Hiroshi NAGAMOCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Let G = (V,E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ R_+, where R_+ denotes the set of nonnegative reals. The source location problem with vertex-connectivity in a given graph G asks to find a set S of vertices with the minimum cardinality such that there are at least d(v) vertex disjoint paths between S and each vertex v ∈ V - S. In this paper, we show that the source location problem with vertex-connectivity can be solved in linear time in the case of d(v) ≦ 3 for all v ∈ V.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) undirected graph / source location problem / local vertex-connectivity / deficient set
Paper # COMP 2002-12
Date of Issue

Conference Information
Committee COMP
Conference Date 2002/5/17(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) Source Location Problem with Local 3-Vertex-Connectivity Requirements
Sub Title (in English)
Keyword(1) undirected graph
Keyword(2) source location problem
Keyword(3) local vertex-connectivity
Keyword(4) deficient set
1st Author's Name Hitoshi FUJITA
1st Author's Affiliation Department of Information and Computer Science, Toyohashi University of Technology()
2nd Author's Name Toshimasa ISHII
2nd Author's Affiliation Department of Information and Computer Science, Toyohashi University of Technology
3rd Author's Name Hiroshi NAGAMOCHI
3rd Author's Affiliation Department of Information and Computer Science, Toyohashi University of Technology
Date 2002/5/17
Paper # COMP 2002-12
Volume (vol) vol.102
Number (no) 90
Page pp.pp.-
#Pages 8
Date of Issue