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 - R, there are k edge-disjoint paths from R to ν and there are l edge-disjoint paths from ν to R.
- Polynomial algorithm
- Source location
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics