An algorithm for source location in directed graphs |
| |
| Authors: | Mihá ly Bá rá sz,Andrá s Frank |
| |
| Affiliation: | Department of Operations Research, Eotvos University, Pazmany Peter setany 1/C, H-1117 Budapest, Hungary |
| |
| 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: | Source location Edge-connectivity Polynomial algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
