Can A Maximum Flow be Computed on o(nm) Time?

Authors:
Joseph Cheriyan;Torben Hagerup;Kurt Mehlhorn
Affiliations:
-;-;-
Venue:
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Year:
1990

Citing 0
Cited 1

Flow faster: efficient decision algorithms for probabilistic simulations

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract