On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow.
Katerina AltmanováPetr KolmanJan VoborníkPublished in: J. Graph Algorithms Appl. (2020)
Keyphrases
- min cost
- worst case
- computational complexity
- optimization problems
- times faster
- data structure
- machine learning algorithms
- orders of magnitude
- computationally efficient
- learning algorithm
- computer vision
- special case
- markov random field
- data sets
- search space
- image sequences
- data mining algorithms
- machine learning
- recently developed
- flow field
- space complexity
- potential functions
- network flow
- data mining