The DOI matches its Crossref record.
Network Flows: Theory, Algorithms, and Applications.
Abstract
A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications. presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models. emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments. provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees. devotes a special chapter to conducting empirical testing of algorithms. features over 150 applications of network flows to a variety of engineering, management, and scientific domains. contains extensive reference notes and illustrations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Items 101–123 of 123
Sinop, A. K., & Grady, L. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408927 · Cited by 277
An ultra-fast user-steered image segmentation paradigm: live wire on the fly
Falcao, A. X., Udupa, J. K., & Miyazawa, F. K. (2000) · IEEE Transactions on Medical Imaging · doi:10.1109/42.832960 · Cited by 275
LEMON – an Open Source C++ Graph Template Library
Dezső, B., Jüttner, A., & Kovács, P. (2011) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2011.06.003 · Cited by 274
Kammerdiner, A., Gevezes, T., Pasiliao, E., Pitsoulis, L., & Pardalos, P. M. (2013) · Encyclopedia of Operations Research and Management Science · doi:10.1007/978-1-4419-1153-7_1152 · Cited by 273
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
Pallottino, S., & Scutellà, M. G. (1998) · Equilibrium and Advanced Transportation Modelling · doi:10.1007/978-1-4615-5757-9_11 · Cited by 267
CARROLL, C., McRAE, B. H., & BROOKES, A. (2012) · Conservation Biology · doi:10.1111/j.1523-1739.2011.01753.x · Cited by 256
Efficient Algorithms for Capacitated Cloudlet Placements
Xu, Z., Liang, W., Xu, W., Jia, M., & Guo, S. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2510638 · Cited by 256
A single-embryo, single-cell time-resolved model for mouse gastrulation
Mittnenzweig, M., Mayshar, Y., Cheng, S., Ben-Yair, R., Hadas, R., Rais, Y., Chomsky, E., Reines, N., Uzonyi, A., Lumerman, L., et al. (2021) · Cell · doi:10.1016/j.cell.2021.04.004 · Cited by 214
Spatiotemporal Data Mining: A Computational Perspective
Shekhar, S., Jiang, Z., Ali, R., Eftelioglu, E., Tang, X., Gunturi, V., & Zhou, X. (2015) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi4042306 · Cited by 206
Swarm intelligence for routing in communication networks
Kassabalidis, I., El-Sharkawi, M. A., Marks, R. J., Arabshahi, P., & Gray, A. A. (2002) · GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270) · doi:10.1109/glocom.2001.966355 · Cited by 200
Making graph theory operational for landscape ecological assessments, planning, and design
Zetterberg, A., Mörtberg, U. M., & Balfors, B. (2010) · Landscape and Urban Planning · doi:10.1016/j.landurbplan.2010.01.002 · Cited by 189
Biological corridors and connectivity
Cushman, S. A., McRae, B., Adriaensen, F., Beier, P., Shirley, M., & Zeller, K. (2013) · Key Topics in Conservation Biology 2 · doi:10.1002/9781118520178.ch21 · Cited by 179
Developmental changes in brain network hub connectivity in late adolescence
Baker, S. T. E., Lubman, D. I., Yucel, M., Allen, N. B., Whittle, S., Fulcher, B. D., Zalesky, A., & Fornito, A. (2015) · Journal of Neuroscience · doi:10.1523/jneurosci.5043-14.2015 · Cited by 168
“A breadth first search (Ahuja et al., 1993) was then used to identify any connected components (i.e., subnetworks) in this matrix, and the number of connections in each component (i.e., component size) was computed.”
MethodRossi, F., Zhang, R., Hindy, Y., & Pavone, M. (2018) · Autonomous Robots · doi:10.1007/s10514-018-9750-5 · Cited by 153
A DTI-Derived Measure of Cortico-Cortical Connectivity
Zalesky, A., & Fornito, A. (2009) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2008.2012113 · Cited by 141
Gabrel, V., & Vanderpooten, D. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00188-6 · Cited by 124
Scalable detection of partial near-duplicate videos by visual-temporal consistency
Tan, H.-K., Ngo, C.-W., Hong, R., & Chua, T.-S. (2009) · Proceedings of the 17th ACM international conference on Multimedia · doi:10.1145/1631272.1631295 · Cited by 110
Towards the fast and robust optimal design of wireless body area networks
D’Andreagiovanni, F., & Nardin, A. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.037 · Cited by 73
A hybrid approach for integrated healthcare cooperative purchasing and supply chain configuration
Rego, N., Claro, J., & Pinho de Sousa, J. (2014) · Health Care Management Science · doi:10.1007/s10729-013-9262-y · Cited by 55
Improving access to health facilities in Nouna district, Burkina Faso
Cocking, C., Flessa, S., & Reinelt, G. (2012) · Socio-Economic Planning Sciences · doi:10.1016/j.seps.2011.12.004 · Cited by 27
Building Markov state models with solvent dynamics
Gu, C., Chang, H.-W., Maibaum, L., Pande, V. S., Carlsson, G. E., & Guibas, L. J. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-s2-s8 · Cited by 21
Identifiability and experimental design in perturbation studies
Gross, T., & Blüthgen, N. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa404 · Cited by 11
Metadata
- Authors
- Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B.
- Venue
- The Journal of the Operational Research Society
- Publisher
- JSTOR
- Published
- 1994-11
- Volume
- 45
- Issue
- 11
- Pages
- 1340
- ISSN
- 0160-5682 (ISSN-L)
- OpenAlex
- W1977545325
- Cited by
- 8,034
- References
- 0
- FWCI
- 96.98
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.