A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs.

Simon Apers Arinta Auza Troy Lee

Published in: CoRR (2021)

Keyphrases

minimum cut
maximum flow
graph partitioning
dynamic programming
optimal solution
particle swarm optimization
graph structure
matching algorithm
energy function
shortest path problem
data clustering
similarity measure
search space
graphical models
np hard
k means
min cut max flow