Maximal Flow Through a Network

Cited in

(only showing first 100 items - show all)

Combinatorial and geometric properties of the max-cut and min-cut problems
Bit threads and holographic monogamy
Controlling a random population
Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
Minimax problem of suppressing a communication network
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
New solutions for disjoint paths in P systems
Compact formulations of the Steiner traveling salesman problem and related problems
On the bond polytope
A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts
Market implementation of multiple-arrival multiple-deadline differentiated energy services
Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
New algorithms for fair \(k\)-center problem with outliers and capacity constraints
Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs
An algorithmic study of the maximum flow problem: A comparative statistical analysis
A fast algorithm for the minimax flow problem with 0/1 weights
Ein kombinatorischer Beweis des Satzes von R. L. Ford und D. R. Fulkerson
Practical minimum cut algorithms
Linear time approximation algorithms for~degree~constrained subgraph problems
TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
Learning-augmented maximum flow
A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
Homomorphisms of Cayley graphs and cycle double covers
Fuzzy optimal flow on imprecise structures
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Decomposition of probability marginals for security games in abstract networks
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
An overview of graph covering and partitioning
Exact and approximation algorithms for sensor placement against DDoS attacks
Edge-Cuts of Optimal Average Weights
Local ratio with negative weights.
Efficient algorithms for estimating loss of information in a complex network: applications to intentional risk analysis
Backdoors to q-Horn
A submodular optimization problem with side constraints
Structure on the top homology and related algorithms
A decomposition algorithm for multi-terminal network flows
A generalization of max flow—min cut
Riemann-Roch theory for graph orientations
Minimum weight clustered dominating tree problem
On the parameterized complexity of separating certain sources from the target
Optimal Partial Tiling of Manhattan Polyominoes
Single-Sink Multicommodity Flow with Side Constraints
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
Fractional matching preclusion number of graphs and the perfect matching polytope
Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures
Truthful mechanism design for multidimensional scheduling via cycle monotonicity
Weighted maximum-clique transversal sets of graphs
Simplifying maximum flow computations: the effect of shrinking and good initial flows
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Disjoint paths in sparse graphs
Optimal cuts in graphs and statistical mechanics
The Minimum Weight In-Tree Cover Problem
Temporal reachability minimization: delaying vs. deleting
Couplings and matchings: combinatorial notes on Strassen's theorem
Quick max-flow algorithm
Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
Equilibria and control of metabolic networks with enhancers and inhibitors
Maximum bipartite flow in networks with adaptive channel width
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
Applications and efficient algorithms for integer programming problems on monotone constraints
The nucleolus of balanced simple flow networks
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
Birnbaum criticality and importance measures for multistate systems with repairable components
Expanders Are Universal for the Class of All Spanning Trees
Selected topics on assignment problems
Optimizing Traffic Signal Timings for Mega Events.
A fast maximum flow algorithm
Firing partial orders in a Petri net
Safety in \(s\)-\(t\) paths, trails and walks
A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
Max-flow min-cut theorem for directed fuzzy incidence networks
Polyhedral Combinatorics in Combinatorial Optimization
Simplifications and speedups of the pseudoflow algorithm
A fast parallel algorithm for minimum-cost small integral flows
Approximate duality of multicommodity multiroute flows and cuts: single source case
Abstract flows over time: a first step towards solving dynamic packing problems
Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity
I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
The Cheeger cut and Cheeger problem in metric measure spaces
Lattices and maximum flow algorithms in planar graphs
A primal-dual algorithm for weighted abstract cut packing
Lehman's theorem and the directed Steiner tree problem
Multi-item Vickrey-English-Dutch auctions
Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
The undirected two disjoint shortest paths problem
Cores and related solution concepts for multi-choice games
Faster and more dynamic maximum flow by incremental breadth-first search
Invulnerability of power grids based on maximum flow theory
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
Quantum max-flow/min-cut
A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
Maximum flows and minimum cuts in the plane
Measuring agility of networked organizational structures via network entropy and mutual information
Optimizing pathfinding for goal legibility and recognition in cooperative partially observable environments
Strategic energy flows in input-output relations: a temporal multilayer approach
A project and lift approach for a 2-commodity flow relocation model in a time expanded network
Complexity and compilability of diagnosis and recovery of graph-based systems
Rainbow disconnection in graphs
A new strategy for the undirected two-commodity 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)