Maximal Flow Through a Network

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

Market implementation of multiple-arrival multiple-deadline differentiated energy services
An overview of graph covering and partitioning
Exact and approximation algorithms for sensor placement against DDoS attacks
Applications and efficient algorithms for integer programming problems on monotone constraints
Firing partial orders in a Petri net
Safety in \(s\)-\(t\) paths, trails and walks
Abstract flows over time: a first step towards solving dynamic packing problems
Lehman's theorem and the directed Steiner tree problem
The complexity of finding small separators in temporal graphs
Metric and ultrametric inequalities for directed graphs
SSE and SSD: page-efficient searchable symmetric encryption
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
Balanced flows for transshipment problems
Title not available (Why is that?)
Reconciliation of a gene network and species tree
Trade-off for heterogeneous distributed storage systems between storage and repair cost
A generalization of the scaling max-flow algorithm
Exact and Approximation Algorithms for the Expanding Search Problem
A self-stabilizing algorithm for the maximum flow problem
An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
Ideal, non-extended formulations for disjunctive constraints admitting a network representation
Iteratively reweighted least squares and slime mold dynamics: connection and convergence
Box-total dual integrality, box-integrality, and equimodular matrices
Algorithms for non-linear and stochastic resource constrained shortest path
A ranking model for the greedy algorithm and discrete convexity
A survey of network interdiction models and algorithms
Polynomial-time algorithms for special cases of the maximum confluent flow problem
On the fractionality of the path packing problem
Sparse process flexibility designs: Is the long chain really optimal?
Intractability of min- and max-cut in streaming graphs
Margin of victory for tournament solutions
Simultaneous classification and community detection on heterogeneous network data
Topology design for on-demand dual-path routing in wireless networks
Randomized approximation schemes for cuts and flows in capacitated graphs
Length-bounded cuts: proper interval graphs and structural parameters
Improved queue-size scaling for input-queued switches via graph factorization
The optimal partitioning of networks
Graph fragmentation problem: analysis and synthesis
Paths and flows for centrality measures in networks
On mergings in acyclic directed graphs
A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points
Efficient algorithms for abstract flow with partial switching
Reverse maximum flow problem under the weighted Chebyshev distance
Abstract network flow with intermediate storage for evacuation planning
Network flow with intermediate storage: models and algorithms
Graph bisection with Pareto optimization
Computing the effective crack energy of heterogeneous and anisotropic microstructures via anisotropic minimal surfaces
The complexity of finding small separators in temporal graphs
Controlling a random population
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
Maximum flow in a network with fuzzy arc capacities
Hall's theorem and extending partial Latinized rectangles
Selecting a discrete portfolio
Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time
The connectivity function of a graph
A polynomial-time simplex method for the maximum \(k\)-flow problem
Maximum flows and minimum cuts in the plane
Multicommodity flows in graphs
Systems of representatives
A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
A primal simplex variant for the maximum-flow problem

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)