An algorithm for source location in directed graphs
2004
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 in V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R.
Details
Title
An algorithm for source location in directed graphs
Author(s)
Bárász, Mihály ; Becker, Johanna ; Frank, András
Published in
Operations Research Letters
Volume
33
Issue
3
Pages
221-230
Date
2004
Keywords
Note
PRO 2004 09 12
Laboratories
ROSO
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-02-13