### 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 - R, there are k edge-disjoint paths from R to ν and there are l edge-disjoint paths from ν to R.

Original language | English |
---|---|

Pages (from-to) | 221-230 |

Number of pages | 10 |

Journal | Operations Research Letters |

Volume | 33 |

Issue number | 3 |

DOIs | |

Publication status | Published - May 2005 |

### Fingerprint

### Keywords

- Edge-connectivity
- Polynomial algorithm
- Source location

### ASJC Scopus subject areas

- Management Science and Operations Research
- Statistics, Probability and Uncertainty
- Discrete Mathematics and Combinatorics
- Modelling and Simulation

### Cite this

*Operations Research Letters*,

*33*(3), 221-230. https://doi.org/10.1016/j.orl.2004.07.005

**An algorithm for source location in directed graphs.** / Bárász, Mihály; Becker, Johanna; Frank, A.

Research output: Contribution to journal › Article

*Operations Research Letters*, vol. 33, no. 3, pp. 221-230. https://doi.org/10.1016/j.orl.2004.07.005

}

TY - JOUR

T1 - An algorithm for source location in directed graphs

AU - Bárász, Mihály

AU - Becker, Johanna

AU - Frank, A.

PY - 2005/5

Y1 - 2005/5

N2 - 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.

AB - 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.

KW - Edge-connectivity

KW - Polynomial algorithm

KW - Source location

UR - http://www.scopus.com/inward/record.url?scp=10044292220&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10044292220&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2004.07.005

DO - 10.1016/j.orl.2004.07.005

M3 - Article

VL - 33

SP - 221

EP - 230

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 3

ER -