Centre for Discrete and Applicable Mathematics
	CDAM Research Report, LSE-CDAM-2004-02 February 2004

Abstract

A set of k-sources for a digraph  D = (V,A)  is a subset S of V such that for any  v in V  there are k arc-disjoint paths that each join a vertex of S to v. We present a polynomial algorithm that finds a minimum size set of k-sources.

This paper is obsolete and the improved version Transversals of Subtree Hypergraphs and the Source Location Problem in Digraphs should be considered instead.

If you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2004-02, together with your name and postal address to:

		CDAM Research Reports Series Centre for Discrete and Applicable Mathematics London School of Economics Houghton Street London WC2A 2AE, U.K.
		Phone: +44(0)-20-7955 7732. Fax: +44(0)-20-7955 6877. Email: info@cdam.lse.ac.uk

		Introduction to the CDAM Research Report Series.
		CDAM Homepage.

Last changed: Wed 9 Feb 2005
For comments go to: http://www.maths.lse.ac.uk/webmaster.html