An algorithm for source location in directed graphs

Operations Research Letters

Volumn 33, Issue 3, 2005, Pages 221-230

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

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Edge connectivity; Polynomial algorithm; Source location

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

EDGE-CONNECTIVITY; POLYNOMIAL ALGORITHM; SOURCE LOCATION;

ALGORITHMS;

EID: 10044292220     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.07.005     Document Type: Article

References (10)

1. A. Bernáth, A note on the directed source location algorithm, Egerváry Research Report, 2004-12.
2. P. Duchet, Hypergraphs (Theorem 3.8), in: R. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, Elsevier, Amsterdam, 1995, pp. 381-432.
3. A. Frank, Some polynomial algorithms for certain graphs and hypergraphs, in: C. Nash-Williams, J. Sheehan (Eds.), Proceedings of the Fifth British Combinatorial Conference, (1975) Congressus Numerantium XV, pp. 211-226.
4. F. Gavril, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM J. Comput. 1 (1972) 180-187.
5. J. Hao, J.B. Orlin, A faster algorithm for finding the minimum cut in a graph, J. Algorithms 17 (1994) 424-446.
6. J. van den Heuvel, M. Johnson, Transversals of subtree hypergraphs and the source location problem in digraphs, CDAM Research Report, LSE-CDAM-2004-10.
7. Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu, Satoru Fujishige, Source location problem with flow requirements in directed networks, Optimization Methods and Software, Vol. 18, No. 4, August 2003, pp. 427-435.
8. M. Labbé, F.V. Louveaux, Location problems, in: M. Dell' Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, 1997, pp. 261-281.
9. N. Megiddo, Combinatorial optimization with rational objective functions, Math. Oper. Res. 4 (1979) 414-424.
10. T. Watanabe, A. Nakamura, Edge-connectivity augmentation problems, Comput. Syst. Sci. 35 (1) (1987) 96-144.