Maximal Flow Through a Network

Cited in

(only showing first 100 items - show all)

Executability of scenarios in Petri nets
An efficient minimum and maximum global snapshot algorithm
Computing monotone disjoint paths on polytopes
Random assignment under weak preferences
Capacitive flows on a 2D random net
A simple algorithm for multicuts in planar graphs with outer terminals
Scheduling multiprocessor UET tasks of two sizes
An approach to the parallel solution of a high-dimensional basic flow problem
Flows with unit path capacities and related packing and covering problems
On a simple deadlock recovery problem
Fuzzy quantities in networks
Polyhedral proof methods in combinatorial optimization
A decomposition algorithm for multi-terminal network flows
The extremal length of a network
An \(O(EV\log^2V)\) algorithm for the maximal flow problem
f-factors and related decompositions of graphs
On the theoretical efficiency of various network flow algorithms
Multicommodity flows in planar graphs
Optimal cocircuits in regular matroids and applications
Maximum flow in a network with fuzzy arc capacities
The ellipsoid method and its consequences in combinatorial optimization
Investments in stochastic maximum flow networks
Ancestor tree for arbitrary multi-terminal cut functions
Short proofs on multicommodity flows and cuts
Maximum concurrent flows and minimum cuts
Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning
Matching theory -- a sampler: From Dénes König to the present
Ein kombinatorischer Beweis des Satzes von R. L. Ford und D. R. Fulkerson
On the connectivity of clusters
On partitions of a partially ordered set
Computational investigations of maximum flow algorithms
Plant location with minimum inventory
The line index and minimum cut of weighted graphs
Flow in planar graphs with vertex capacities
On the \(l\)-connectivity of a digraph
Dynamic programming and graph optimization problems
Two-edge connected spanning subgraphs and polyhedra
Optimally balancing assembly lines with different workstations
An analytic symmetrization of max flow-min cut
On perfectly two-edge connected graphs
Dynamic graph models
A fast algorithm for the minimax flow problem with 0/1 weights
A T_X-approach to some results on cuts and metrics
Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
Fuzzy optimal flow on imprecise structures
Optimal wavelength-routed multicasting
An algorithmic study of the maximum flow problem: A comparative statistical analysis
Invulnerability of power grids based on maximum flow theory
On solving mutual liability problems
The stochastic stability of decentralized matching on a graph
Robust routing in deterministic delay-tolerant networks
Rainbow disconnection in graphs
Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
Some bounds on the generalised total chromatic number of degenerate graphs
Sparse certificates for 2-connectivity in directed graphs
A decomposition for the Schrödinger equation with applications to bilinear and multilinear estimates
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
Allocation under a general substitution structure
Greedy oriented flows
Parametric multiroute flow and its application to multilink-attack network
Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
A faster polynomial algorithm for the constrained maximum flow problem
Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
Parameterized complexity of length-bounded cuts and multicuts
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Multicommodity flows in graphs
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
A dual description of the class of games with a population monotonic allocation scheme
A generalization of the scaling max-flow algorithm
Circuit duality for recurrent Markov processes
A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts
An auction algorithm for the max-flow problem
The general counterfeit coin problem
Multiterminal flows and cuts
On the fractionality of the path packing problem
Intractability of min- and max-cut in streaming graphs
Simultaneous classification and community detection on heterogeneous network data
Topology design for on-demand dual-path routing in wireless networks
Graphs with no \(K_{3,3}\) minor containing a fixed edge
Market implementation of multiple-arrival multiple-deadline differentiated energy services
On matching numbers of tree and bipartite degree sequences
The complexity of finding small separators in temporal graphs
Trade-off for heterogeneous distributed storage systems between storage and repair cost
A hybrid heuristic for the maximum dispersion problem
Box-total dual integrality, box-integrality, and equimodular matrices
Margin of victory for tournament solutions
A new LP rounding algorithm for the active time problem
Efficient algorithms for abstract flow with partial switching
Negativity spectra in random tensor networks and holography
Colored cut games
Maximin problem of communication network synthesis
A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
Abstract network flow with intermediate storage for evacuation planning
Bounds for the rainbow disconnection numbers of graphs
Computing the effective crack energy of heterogeneous and anisotropic microstructures via anisotropic minimal surfaces
Firing partial orders in a Petri net
Safety in s-t paths, trails and walks
Length-bounded cuts: proper interval graphs and structural parameters

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3237973)