Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On mimicking networks representing minimum terminal cuts
Information Processing Letters
Hi-index | 0.01 |