scientific article
From MaRDI portal
Publication:4038695
zbMath0768.90020MaRDI QIDQ4038695
Torben Hagerup, Kurt Mehlhorn, Joseph Cheriyan
Publication date: 18 May 1993
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) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)
Related Items (11)
Algorithms for dense graphs and networks on the random access computer ⋮ On implementing push-relabel method for the maximum flow problem ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Search for all \(d\)-mincuts of a limited-flow network ⋮ Deciding bisimilarity and similarity for probabilistic processes. ⋮ On complexity of special maximum matchings constructing ⋮ Symbolic Bisimulation for Quantum Processes ⋮ Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) ⋮ A cell formation algorithm: Hypergraph approximation -- cut tree ⋮ Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors ⋮ On the complexity of preflow-push algorithms for maximum-flow problems
This page was built for publication:
