Article ID Journal Published Year Pages File Type
10524095 Operations Research Letters 2005 10 Pages PDF
Abstract
A polynomial time solution algorithm is described to find a smallest subset R of nodes of a directed graph D=(V,A) such that, for every node v∈V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
An algorithm for source location in directed graphs
Authors
, , ,