An algorithm for source location in directed graphs

An algorithm for source location in directed graphs

0.00 Avg rating0 Votes
Article ID: iaor20051661
Country: Netherlands
Volume: 33
Issue: 3
Start Page Number: 221
End Page Number: 230
Publication Date: May 2005
Journal: Operations Research Letters
Authors: , ,
Keywords: graphs
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.

Reviews

Required fields are marked *. Your email address will not be published.