An algorithm for source location in directed graphs

Authors:
MiháLy BáRáSz;Johanna Becker;AndráS Frank
Affiliations:
Department of Operations Research, Eotvos University, Pazmany Peter setany 1/C, H-1117 Budapest, Hungary;Department of Operations Research, Eotvos University, Pazmany Peter setany 1/C, H-1117 Budapest, Hungary;Department of Operations Research, Eotvos University, Pazmany Peter setany 1/C, H-1117 Budapest, Hungary
Venue:
Operations Research Letters
Year:
2005

Citing 4
Cited 9

Edge-connectivity augmentation problems

Journal of Computer and System Sciences
A faster algorithm for finding the minimum cut in a directed graph

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Hypergraphs

Handbook of combinatorics (vol. 1)
Transversals of subtree hypergraphs and the source location problem in digraphs

Networks

Minimum transversals in posi-modular systems

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs

Journal of Discrete Algorithms
Simultaneous source location

ACM Transactions on Algorithms (TALG)
Graph Orientations with Set Connectivity Requirements

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Minimum cost source location problems with flow requirements

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Source location in undirected and directed hypergraphs

Operations Research Letters
Source location with rigidity and tree packing requirements

Operations Research Letters
Blocking optimal arborescences

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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.