ESA
13 years 11 months ago
2004 Springer  ESA
13 years 11 months ago
2004 Springer 
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
ESA
13 years 9 months ago
2004 Springer  ESA
13 years 11 months ago
2004 Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
ESA
13 years 11 months ago
2004 Springer
Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B usi...
|
Algorithms