On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow.

Katerina Altmanová Petr Kolman Jan Voborník

Published in: WADS (2019)

Keyphrases

computational complexity
min cost
learning algorithm
computational cost
times faster
theoretical analysis
orders of magnitude
data mining
decision trees
worst case
computationally efficient
computational efficiency