The source location problem with local 3-vertex-connectivity requirements

  title={The source location problem with local 3-vertex-connectivity requirements},
  author={Toshimasa Ishii and Hitoshi Fujita and Hiroshi Nagamochi},
  journal={Discrete Applied Mathematics},
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 an integer valued demand d(v) ≥ 0. The source location problem with vertex-connectivity requirements 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 problem with d(v) ≤ 3, v ∈ V can be solved in linear time. Moreover, we show… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
18 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 18 references

Source location problem with edge-connectivity requirements in digraphs

  • H. Ito, K. Makino, K. Arata, K. Itatsu, S. Fujishige
  • Proceeding of 2nd Japanese- Hungarian Symposium…
  • 2001
2 Excerpts

A faster and flexible algorithm for a location problem on undirected flow networks

  • H. Ito, H. Uehara, M. Yokoyama
  • IEICE Trans., E83-A(4)
  • 2000
2 Excerpts

An algorithm for finding a node-subset having high connectivity from other nodes

  • S. Honami, H. Ito, H. Uehara, M. Yokoyama
  • IPSJ SIG Notes, AL-66-2
  • 1999
1 Excerpt

NA-edge-connectivity augmentation problem –algorithms and complexity for 1-NA-edge-connectivity augmentation and 2-NA-edgeconnectivity augmentation

  • H. Miwa, H. Ito
  • 1999 Technical Report of IPSJ, 99-AL-66(8),
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…