An algorithm for source location in directed graphs

Mihály Bárász, Johanna Becker, András Frank

Research output: Contribution to journalArticle

21 Citations (Scopus)


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 languageEnglish
Pages (from-to)221-230
Number of pages10
JournalOperations Research Letters
Issue number3
Publication statusPublished - May 1 2005



  • Edge-connectivity
  • Polynomial algorithm
  • Source location

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this