The DOI matches its Crossref record.
A note on the maximum flow through a network
Abstract
This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists of a number of branches, each of which has a limited capacity. The main result is a theorem: The maximum possible flow from left to right through a network is equal to the minimum value among all simple cut-sets. This theorem is applied to solve a more general problem, in which a number of input nodes and a number of output nodes are used.
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Independent paths do not share any edge (vertex), and their number is related to the maximum flow that can be conveyed between the two vertices under the constraint that each edge can carry only one unit of flow (max-flow/min-cut theorem [87]).”
BackgroundAn algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
The SECOQC quantum key distribution network in Vienna
Peev, M., Pacher, C., Alléaume, R., Barreiro, C., Bouda, J., Boxleitner, W., Debuisschert, T., Diamanti, E., Dianati, M., Dynes, J. F., et al. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/7/075001 · Cited by 845
Chiu, S. J., Li, X. T., Nicholas, P., Toth, C. A., Izatt, J. A., & Farsiu, S. (2010) · Optics Express · doi:10.1364/oe.18.019413 · Cited by 733
A new approach to the minimum cut problem
Karger, D. R., & Stein, C. (1996) · Journal of the ACM · doi:10.1145/234533.234534 · Cited by 485
Kovács, I. A., Palotai, R., Szalay, M. S., & Csermely, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012528 · Cited by 338
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Garg, N., Vazirani, V. V., & Yannakakis, M. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793243016 · Cited by 335
End-to-end capacities of a quantum communication network
Pirandola, S. (2019) · Communications Physics · doi:10.1038/s42005-019-0147-3 · Cited by 306
Fragouli, C., & Soljanin, E. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601980335 · Cited by 288
Reliable Physical Layer Network Coding
Nazer, B., & Gastpar, M. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2094170 · Cited by 276
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
Aumann, Y., & Rabani, Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794285983 · Cited by 260
Network Coding for the Internet and Wireless Networks
Chou, P., & Wu, Y. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.904818 · Cited by 253
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
Metadata
- Authors
- Elias, P., Feinstein, A., & Shannon, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1956-12
- Volume
- 2
- Issue
- 4
- Pages
- 117-119
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2154501376
- Cited by
- 456
- References
- 0
- FWCI
- 6.01
- 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.