An algorithm for source location in directed graphs

Mihály Bárász, Johanna Becker, A. Frank

Research output: Contribution to journalArticle

21 Citations (Scopus)

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 221-230 10 Operations Research Letters 33 3 https://doi.org/10.1016/j.orl.2004.07.005 Published - May 2005

Fingerprint

Edge-disjoint Paths
Directed graphs
Set theory
Directed Graph
Polynomials
Vertex of a graph
Polynomial time
Subset
Node
Directed graph

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

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

In: Operations Research Letters, Vol. 33, No. 3, 05.2005, p. 221-230.

Research output: Contribution to journalArticle

Bárász, Mihály ; Becker, Johanna ; Frank, A. / An algorithm for source location in directed graphs. In: Operations Research Letters. 2005 ; Vol. 33, No. 3. pp. 221-230.
@article{cffd67d27cf54137ab11cdaf42a7f34e,
title = "An algorithm for source location in directed 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 - R, there are k edge-disjoint paths from R to ν and there are l edge-disjoint paths from ν to R.",
keywords = "Edge-connectivity, Polynomial algorithm, Source location",
author = "Mih{\'a}ly B{\'a}r{\'a}sz and Johanna Becker and A. Frank",
year = "2005",
month = "5",
doi = "10.1016/j.orl.2004.07.005",
language = "English",
volume = "33",
pages = "221--230",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "3",

}

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 -