Keyword

maximum flow

Description: Maximum flow is a graph-theoretic optimization problem that finds the greatest feasible quantity of flow from a source to a destination in a network.

Primary topic: Complexity and Algorithms in Graphs (47%)

Wikidata ID: wiki/Q2585642

OpenAlex ID: keywords/maximum-flow

Network Flows: Theory, Algorithms, and Applications.

1994 · David K. Smith, Ravindra K. Ahuja, et al. · Journal of the Operational Research Society · 8,120

Qualitative data analysis (2nd ed)

1996 · Janice M. Morse · Journal of Psychosomatic Research · 5,593

Linear network coding

2003 · S.-Y.R. Li, R.W. Yeung, et al. · IEEE Transactions on Information Theory · 3,389

Network flows: Theory, algorithms and applications

1994 · Discrete Applied Mathematics · 2,585

Maximal Flow Through a Network

1956 · L. R. Ford, D. R. Fulkerson · Canadian Journal of Mathematics · 2,452

PDF

Network Flows

2011 · Ravindra K. Ahuja, Thomas L. Magnanti, et al. · 2,074

Linear Programming and Network Flows

1978 · C. R. Sergeant, Mokhtar S. Bazaraa, et al. · Journal of the Operational Research Society · 1,973

A new approach to the maximum-flow problem

1988 · Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1,884

PDF

Maximal Flow Through a Network

2009 · L. R. Ford, D. R. Fulkerson · Birkhäuser Boston eBooks · 1,828

Operations Research: Applications and Algorithms

1988 · Eric R. Ziegel, Wayne Winston · Technometrics · 1,692

Exact Maximum A Posteriori Estimation for Binary Images

1989 · D. M. Greig, B. T. Porteous, et al. · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1,056

A data structure for dynamic trees

1983 · Daniel D. Sleator, Robert Endre Tarjan · Journal of Computer and System Sciences · 1,018

Multiprocessor Scheduling with the Aid of Network Flow Algorithms

1977 · H.S. Stone · IEEE Transactions on Software Engineering · 680

The Complexity of Multiterminal Cuts

1994 · E. Dahlhaus, D. S. Johnson, et al. · SIAM Journal on Computing · 664

Operations research : applications and algorithms

1994 · Wayne L. Winston · 635

Applying Parallel Computation Algorithms in the Design of Serial Algorithms

1983 · Nimrod Megiddo · Journal of the ACM · 626

PDF

Deterministic network interdiction

1993 · R.Kevin Wood · Mathematical and Computer Modelling · 624

PDF

The Boost graph library : user guide and reference manual

2002 · Jeremy G. Siek, Lie‐Quan Lee, et al. · CERN Document Server (European Organization for Nuclear Research) · 602

A Fast Parametric Maximum Flow Algorithm and Applications

1989 · Giorgio Gallo, Michael D. Grigoriadis, et al. · SIAM Journal on Computing · 584

Network Flow and Testing Graph Connectivity

1975 · Shimon Even, R. Endre Tarjan · SIAM Journal on Computing · 550

Truthful mechanisms for one-parameter agents

2001 · A. Archer, E. Tardos · Annual Symposium on Foundations of Computer Science · 521

LEDA: A platform for combinatorial and geometric computing

2000 · Computers & Mathematics with Applications · 489

A maximum-flow formulation of the N-camera stereo correspondence problem

2002 · S. Roy, I.J. Cox · International Conference on Computer Vision · 485

Beyond the flow decomposition barrier

1998 · Andrew V. Goldberg, Satish Rao · Journal of the ACM · 467

PDF

A note on the maximum flow through a network

1956 · P. Elias, A. Feinstein, et al. · IEEE Transactions on Information Theory · 456

Works count: 4,482

Citation count: 90,360