scientific article; zbMATH DE number 742960
From MaRDI portal
Publication:4763402
zbMath0829.68094MaRDI QIDQ4763402
No author found.
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Related Items (7)
Recent developments in maximum flow algorithms ⋮ 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 ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Efficient algorithms for minimum range cut problems ⋮ On implementing push-relabel method for the maximum flow problem ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
This page was built for publication:
