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
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

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)