scientific article; zbMATH DE number 742960

zbMATH Open0829.68094MaRDI QIDQ4763402FDOQ4763402

Authors:

Publication date: 11 April 1995

Title of this publication is not available (Why is that?)

Recommendations

• A Faster Deterministic Maximum Flow Algorithm
• An $o(n^3 )$-Time Maximum-Flow Algorithm
• An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
• scientific article; zbMATH DE number 177817
• Quick max-flow algorithm

zbMATH Keywords

maximum flow problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (14)

• A Faster Deterministic Maximum Flow Algorithm
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
• On implementing push-relabel method for the maximum flow problem
• Efficient algorithms for minimum range cut problems
• Quick max-flow algorithm
• A faster polynomial algorithm for the constrained maximum flow problem
• Title not available (Why is that?)
• Breaking the \(O(n^{2.5})\) deterministic time barrier for undirected unit-capacity maximum flow
• A strongly polynomial algorithm for the minimum cost tension problem
• A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
• Generating pseudo-random permutations and maximum flow algorithms
• Hypergraph Cuts with General Splitting Functions
• Recent developments in maximum flow algorithms
• An incremental algorithm for the maximum flow problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763402)