Loading...
research article
An algorithm for source location in directed graphs
Bárász, Mihály
•
Becker, Johanna
•
Frank, András
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.
Type
research article
Authors
Bárász, Mihály
•
Becker, Johanna
•
Frank, András
Publication date
2004
Published in
Volume
33
Issue
3
Start page
221
End page
230
Note
PRO 2004 09 12
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record