Network Flow Algorithms

Network Flow Algorithms

Cached

Download Links

by Andrew V. Goldberg , Eva Tardos , Robert E. Tarjan

Venue:	REPRINT FROM ALGORITHMS AND COMBINATORICS VOLUME 9
Citations:	32 - 3 self

BibTeX

@MISC{Goldberg_networkflow,
    author = {Andrew V. Goldberg and Eva Tardos and Robert E. Tarjan},
    title = {Network Flow Algorithms},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1055	Combinatorial Optimization: Algorithms and Complexity - Papadimitriou, Steiglitz - 1982
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
638	Linear Programming and Extensions - Dantzig - 1963
557	Data Structures and Network Algorithms - Tarjan - 1983
539	A new polynomial-time algorithm for linear programming - Karmarkar - 1984
510	The hungarian method for the assignment problem - Kuhn - 1955
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
457	An n 5/2 algorithm for maximum matchings in bipartite graphs - Hopcroft, Karp - 1973
424	C: Graphs and Hypergraphs - Berge - 1973
391	A new approach to the maximum flow problem - Goldberg, Tarjan
387	Combinatory Optimization: Networks and Matroids - Lawler - 1976
312	Graph Algorithms - Even - 1979
306	A polynomial algorithm in linear programming, Doklady Akad - Khachiyan - 1979
281	Theoretical improvements in algorithmic efficiency for network flow problems - Edmonds, Karp - 1970
265	A data structure for dynamic trees - Sleator, Tarjan - 1983
260	Parallelism in random access machines - Fortune, Wyllie - 1978
188	Maximal flow through a network - Fulkerson - 1956
182	Design and implementation of an efficient priority queue - Boas, Kaas, et al. - 1977
173	A characterization of the minimum cycle mean in a digraph - Karp - 1978
142	Graphs and algorithms - Gondran, Minoux - 1984
140	Matching is as easy as matrix inversion - Mulmuley, Vazirani, et al. - 1987
129	Amortized computational complexity - Tarjan - 1985
111	Faster scaling algorithms for network problems - Gabow, Tarjan - 1989
103	Algorithm for solution of a problem of maximum flow in networks with power estimation - Dinic - 1970
97	Theorie der endlichen und unendlichen Graphen, Akademische Verlagsgesellschaft - König - 1936
96	A faster strongly polynomial minimum cost flow algorithm, Oper Res 41 - Orlin - 1993
91	Faster algorithms for the shortest path problem - Ahuja, Mehlhorn, et al.
76	Network Flow and Testing Graph Connectivity - Even, Tarjan - 1975
56	Solving minimum-cost flow problems by successive approximation - Goldberg, Tarjan - 1987
56	A strongly polynomial minimum cost circulation algorithm - Tardos - 1985
53	Scaling algorithms for network problems - Gabow - 1983
53	Finding minimum-cost circulations by cancelling negative cycles - Goldberg, Tarjan
45	Finding Minimum-Cost Circulations by Successive Approximation - Goldberg, Tarjan - 1990
43	New scaling algorithms for the assignment and minimum mean cycle problems - Orlin, Ahuja - 1992
40	Efficient Graph Algorithms for Sequential and Parallel Computers - GoLDBERG - 1987
39	Determining the maximal flow in a network by the method of preflows - Karzanov - 1974
36	Flow in planar graphs with multiple sources and sinks - Miller, Naor - 1995
34	Improved time bounds for the maximum flow problem - Ahuja, Orlin, et al. - 1989
33	Sublinear-time parallel algorithms for matching and related problems - Goldberg, Plotkin, et al. - 1993
33	Speeding up linear programming using fast matrix multiplication - Vaidya - 1989
27	Fast algorithms for convex quadratic programming and multicommodity flows - Kapoor, Vaidya - 1986
26	A fast and simple algorithm for the maximum flow problem - Ahuja, Orlin - 1989
26	Dual Coordinate Step Methods for Linear Network Flow Problems - Bertsekas, Eckstein - 1989
26	Finite graphs and networks: An introduction with applications - Busacker, Saaty - 1965
26	A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow." Annals of Operation Research - Goldfarb, Grigoriadis - 1988
25	Distributed asynchronous relaxation methods for linear network flow problems - Bertsekas, Eckstein - 1986
25	Combinatorial Algorithms for the Generalized Circulation Problem - Goldberg, Plotkin, et al. - 1988
25	A bad network problem for the simplex method and other minimum cost ow algorithms - Zadeh - 1973
24	A network simplex method - Cunningham - 1976
23	Finding minimumcost flows by double scaling - AHUJA, GOLDBERG, et al. - 1988