scientific article; zbMATH DE number 2086656
From MaRDI portal
Publication:4737193
zbMATH Open1057.90501MaRDI QIDQ4737193
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800611.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recommendations
- Unnamed Item 👍 👎
- Simplifying maximum flow computations: the effect of shrinking and good initial flows 👍 👎
- On the relation of max-flow to min-cut for generalized networks 👍 👎
- Improving time bounds on maximum generalised flow computations by contracting the network 👍 👎
- A generalization of the scaling max-flow algorithm 👍 👎
- Faster algorithms for the generalized network flow problem 👍 👎
- Parametric maximal flows in generalized networks – complexity and algorithms 👍 👎
- Improved Time Bounds for the Maximum Flow Problem 👍 👎
- Approximate Max-Flow on Small Depth Networks 👍 👎
- Efficiently Computing Maximum Flows in Scale-Free Networks. 👍 👎
This page was built for publication:
