Login / Signup
Development and research of the algorithm fordetermining the maximum flow at distribution inthe network.
Ainur Akhmediyarova
Dinara Kassymova
Anar Utegenova
Irbulat Utepbergenov
Published in:
Open Comput. Sci. (2016)
Keyphrases
</>
maximum flow
minimum cut
optimal solution
k means
dynamic programming
pairwise
np hard
similarity measure
segmentation algorithm
information theoretic
knapsack problem
push relabel