Maximal Flow Through a Network

Cited In (only showing first 100 items - show all)

Minimax problem of suppressing a communication network
Practical minimum cut algorithms
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Fuzzy optimal flow on imprecise structures
Local ratio with negative weights.
A decomposition algorithm for multi-terminal network flows
The Minimum Weight In-Tree Cover Problem
Disjoint paths in sparse graphs
Optimal cuts in graphs and statistical mechanics
Quick max-flow algorithm
A fast maximum flow algorithm
Measuring agility of networked organizational structures via network entropy and mutual information
Limsup deviations on trees
Rainbow disconnection in graphs
On perfectly two-edge connected graphs
Opposite elements in clutters
A new strategy for the undirected two-commodity maximum flow problem
The multi-terminal maximum-flow network-interdiction problem
A faster polynomial algorithm for the constrained maximum flow problem
Maximin problem of communication network synthesis
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
Stability of metabolic networks via linear-in-flux-expressions
On r-regular r-connected non-hamiltonian graphs
Polyhedral results on single node variable upper-bound flow models with allowed configurations
Maximum-throughput dynamic network flows
More on the rainbow disconnection in graphs
DNA sequence assembly involving an acyclic graph model
Executability of scenarios in Petri nets
An efficient minimum and maximum global snapshot algorithm
A strongly polynomial time algorithm for a constrained submodular optimization problem
Parameterized complexity of length-bounded cuts and multicuts
A generalized dynamic flows problem
A survey of parameterized algorithms and the complexity of edge modification
Computing monotone disjoint paths on polytopes
Optimal wavelength-routed multicasting
A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers
The general counterfeit coin problem
A fuzzy max-flow min-cut theorem.
Fuzzy quantities in networks
Computing area-optimal simple polygonizations
A simple algorithm for multicuts in planar graphs with outer terminals
Implementing Goldberg's max-flow-algorithm ? A computational investigation
The Generalized Regenerator Location Problem
On efficiently solvable cases of quantum \(k\)-SAT
On efficiently solvable cases of quantum \(k\)-SAT
Colored cut games
Efficient continuous contraflow algorithms for evacuation planning problems
Optimization in telecommunication networks
The maximum integer multiterminal flow problem in directed graphs
The Cheeger cut and Cheeger problem in metric graphs
Sensitivity analysis of 0-1 multiterminal network flows
Investments in stochastic maximum flow networks
Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity
Financial systems: A few theoretical and algebraic considerations for their modeling
An \(O(EV\log^2V)\) algorithm for the maximal flow problem
The effectiveness of finite improvement algorithms for finding global optima
Capacitive flows on a 2D random net
An auction algorithm for the max-flow problem
Optimally balancing assembly lines with different workstations
Constrained flow control in storage networks: capacity maximization and balancing
The symbolic algorithms for maximum flow in networks
On the connectivity of clusters
Bit threads and holographic monogamy
Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts
Linear time approximation algorithms for~degree~constrained subgraph problems
A generalization of max flow—min cut
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
Weighted maximum-clique transversal sets of graphs
Simplifying maximum flow computations: the effect of shrinking and good initial flows
Expanders Are Universal for the Class of All Spanning Trees
Maximum bipartite flow in networks with adaptive channel width
Polyhedral Combinatorics in Combinatorial Optimization
Multi-item Vickrey-English-Dutch auctions
Quantum max-flow/min-cut
A specialized network simplex algorithm for the constrained maximum flow problem
Properties of the DGS-auction algorithm
Partitioning planar graphs: a fast combinatorial approach for max-cut
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
On maximum flows in polyhedral domains
Error exponents for two-hop Gaussian multiple source-destination relay channels
The computational complexity of optimal blocking of vertices in the digraph
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
Probabilistic strategy-proof rules over single-peaked domains
Three commodity flows in graphs
A class of h-perfect graphs
Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
Pathwidth, trees, and random embeddings
\((F, I)\)-security in graphs
Cycle extensions in BIBD block-intersection graphs
Discrete bulk reconstruction
On partitions of a partially ordered set
Paths of bounded length and their cuts: parameterized complexity and algorithms
Paths of bounded length and their cuts: parameterized complexity and algorithms
A critical survey on the network optimization algorithms for evacuation planning problems
The multiroute maximum flow problem revisited
Network flow interdiction on planar graphs
Counting and sampling minimum cuts in genus \(g\) graphs
Allocation under a general substitution structure
GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY

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)