An algorithm for source location in directed graphs

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 in V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R.


Published in:
Operations Research Letters, 33, 3, 221-230
Year:
2004
Keywords:
Note:
PRO 2004 09 12
Laboratories:




 Record created 2006-02-13, last modified 2018-01-27

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)