A Faster Deterministic Maximum Flow Algorithm
From MaRDI portal
Recommendations
Cited in
(45)- An incremental algorithm for the maximum flow problem
- scientific article; zbMATH DE number 742960 (Why is no real title available?)
- Structural and algorithmic properties for parametric minimum cuts
- scientific article; zbMATH DE number 1256749 (Why is no real title available?)
- Tight localizations of feedback sets
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Bribery and control in stable marriage
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Quick max-flow algorithm
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- A Randomized Maximum-Flow Algorithm
- A fast maximum flow algorithm
- Simplifications and speedups of the pseudoflow algorithm
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
- Improved balanced flow computation using parametric flow
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- A faster polynomial algorithm for the constrained maximum flow problem
- Decomposing semi-complete multigraphs and directed graphs into paths of length two
- Clustering with lower-bounded sizes. A general graph-theoretic framework
- A generalization of the scaling max-flow algorithm
- Separation, dimension, and facet algorithms for node flow polyhedra
- Maximum skew-symmetric flows
- How vulnerable is an undirected planar graph with respect to max flow
- Faster algorithms for shortest path and network flow based on graph decomposition
- Minimum cut in \(O(m \log^2 n)\) time
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- Minimum cut in O(m^2 n time
- Integral biflow maximization
- Measuring external conflict in Dempster-Shafer theory based on Kantorovich problems
- How vulnerable is an undirected planar graph with respect to max flow
- Efficient Algorithms for the k Smallest Cuts Enumeration
- Finding dense subgraphs with maximum weighted triangle density
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Enhanced instance space analysis for the maximum flow problem
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)
- Geometric matching and bottleneck problems
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
- A general approximation method for bicriteria minimization problems
- A new algorithm for solving the feasibility problem of a network flow
- Dynamic programming on bipartite tree decompositions
- Recent developments in maximum flow algorithms
- An improved algorithm for decomposing arc flows into multipath flows
- Efficient algorithms for the maximum concurrent flow problem
This page was built for publication: A Faster Deterministic Maximum Flow Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4314501)
