Cookies?
Library Header Image
LSE Research Online LSE Library Services

Transversals of subtree hypergraphs and the source location problem in digraphs

van den Heuvel, Jan and Johnson, Matthew (2008) Transversals of subtree hypergraphs and the source location problem in digraphs. Networks, 51 (2). pp. 113-119. ISSN 0028-3045

Full text not available from this repository.

Abstract

A hypergraph H = (V,E) is a subtree hypergraph if there is a tree T on V such that each hyperedge of E induces a subtree of T. Since the number of edges of a subtree hypergraph can be exponential in n = |V|, one can not always expect to be able to find a minimum size transversal in time polynomial in n. In this paper, we show that if it is possible to decide if a set of vertices W V is a transversal in time S(n) (where n = |V|), then it is possible to find a minimum size transversal in O(n3S(n)). This result provides a polynomial algorithm for the Source Location Problem: a set of (k,l)-sources for a digraph D = (V,A) is a subset S of V such that for any v V there are k arc-disjoint paths that each join a vertex of S to v and l arc-disjoint paths that each join v to S. The Source Location Problem is to find a minimum size set of (k,l)-sources. We show that this is a case of finding a transversal of a subtree hypergraph, and that in this case S(n) is polynomial.

Item Type: Article
Official URL: http://www3.interscience.wiley.com/journal/32046/h...
Additional Information: © 2008 Wiley-Blackwell
Library of Congress subject classification: Q Science > QA Mathematics
Sets: Departments > Mathematics
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 18 Feb 2009 12:35
URL: http://eprints.lse.ac.uk/22725/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only