On finding convex cuts in general, bipartite and plane graphs.

Roland Glantz Henning Meyerhenke

Published in: Theor. Comput. Sci. (2017)

Keyphrases

special case
bipartite graph
graph model
graph partitioning
closely related
graph theoretic
data sets
neural network
directed graph
real valued
undirected graph
min cut
risk minimization