Maximal Flow Through a Network

DOI10.4153/CJM-1956-045-5zbMath0073.40203OpenAlexW4213060883WikidataQ55880658 ScholiaQ55880658MaRDI QIDQ3237973

D. R. Fulkerson, L. R. Ford, Jr.

Publication date: 1956

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1956-045-5

zbMATH Keywords

Topology

Related Items (only showing first 100 items - show all)

Minimum Cuts in Surface Graphs ⋮ Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen ⋮ BIRNBAUM CRITICALITY AND IMPORTANCE MEASURES FOR MULTISTATE SYSTEMS WITH REPAIRABLE COMPONENTS ⋮ Recent developments in maximum flow algorithms ⋮ An Algorithm for Vertex-pair Connectivity ⋮ Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Optimization in telecommunication networks ⋮ APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS ⋮ GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY ⋮ Unnamed Item ⋮ Simplifications and speedups of the pseudoflow algorithm ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ Graph Bisection with Pareto Optimization ⋮ Optimal interdiction of a supply network ⋮ TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration ⋮ Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems ⋮ Cores and related solution concepts for multi-choice games ⋮ Persuasion and dynamic communication ⋮ Generalized max flows and augmenting paths ⋮ Computing Area-Optimal Simple Polygonizations ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Matching cells ⋮ FlowLoc problems with maximum excess flow ⋮ On the bond polytope ⋮ A fast maximum flow algorithm ⋮ Paths and flows for centrality measures in networks ⋮ Graph fragmentation problem: analysis and synthesis ⋮ MTGL-ADMET: a novel multi-task graph learning framework for ADMET prediction enhanced by status-theory and maximum flow ⋮ Decomposition of probability marginals for security games in abstract networks ⋮ Applications and efficient algorithms for integer programming problems on monotone constraints ⋮ Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms ⋮ An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems ⋮ Discrete bulk reconstruction ⋮ Foundations of operations research: from linear programming to data envelopment analysis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Making Bipartite Graphs DM-Irreducible ⋮ The st-bond polytope on series-parallel graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Maximum Flow Problem for Oriented Flows ⋮ Optimizing Traffic Signal Timings for Mega Events. ⋮ Edge-Cuts of Optimal Average Weights ⋮ Unnamed Item ⋮ A self-stabilizing algorithm for the maximum flow problem ⋮ Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts ⋮ A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints ⋮ Practical Minimum Cut Algorithms ⋮ Converse bounds for quantum and private communication over Holevo–Werner channels ⋮ Multiway cuts in directed and node weighted graphs ⋮ Mincut Sensitivity Data Structures for the Insertion of an Edge ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. ⋮ Complexity and compilability of diagnosis and recovery of graph-based systems ⋮ The Complexity of Finding Small Separators in Temporal Graphs ⋮ The computational complexity of optimal blocking of vertices in the digraph ⋮ A submodular optimization problem with side constraints ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ Group field theory and holographic tensor networks: dynamical corrections to the Ryu–Takayanagi formula ⋮ Über reguläre Kettengruppen ⋮ A fuzzy max-flow min-cut theorem. ⋮ Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures ⋮ Limsup deviations on trees ⋮ Sparse Process Flexibility Designs: Is the Long Chain Really Optimal? ⋮ A cycle augmentation algorithm for minimum cost multicommodity flows on a ring ⋮ Time-varying universal maximum flow problems ⋮ Shortest-Path-Finder Algorithm in a Two-Dimensional Array of Nonlinear Electronic Circuits ⋮ A strongly polynomial time algorithm for a constrained submodular optimization problem ⋮ Improved availability bounds for binary and multistate monotone systems with independent component processes ⋮ Homomorphisms of Cayley graphs and cycle double covers ⋮ Extension of Rescheduling Based on Minimal Graph Cut ⋮ A Parametrized Analysis of Algorithms on Hierarchical Graphs ⋮ Unnamed Item ⋮ Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm ⋮ The multiroute maximum flow problem revisited ⋮ Approximating small balanced vertex separators in almost linear time ⋮ Systems of representatives ⋮ Opposite Elements in Clutters ⋮ BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT ⋮ On Mergings in Acyclic Directed Graphs ⋮ Unnamed Item ⋮ Faster algorithms for shortest path and network flow based on graph decomposition ⋮ Polyhedral Results and Branch-and-Cut for the Resource Loading Problem ⋮ Flows with Unit Path Capacities and Related Packing and Covering Problems ⋮ Improved queue-size scaling for input-queued switches via graph factorization ⋮ Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs ⋮ Fast Augmenting Paths by Random Sampling from Residual Graphs ⋮ Unnamed Item ⋮ Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Explainable dynamic programming ⋮ Analysis of Biological Data by Graph Theory Approach Searching of Iron in Biological Cells ⋮ The connectivity function of a graph ⋮ Evacuation schemes on Cayley graphs and non-amenability of groups ⋮ Network Flow-Based Refinement for Multilevel Hypergraph Partitioning ⋮ Isolation scheduling on multicores: model and scheduling approaches

This page was built for publication: Maximal Flow Through a Network