Login / Signup
One Minimum-Cost Network Flow Problem to Identify a Graph's Connected Components.
Joanna Bauer
Published in:
CTW (2011)
Keyphrases
</>
connected components
minimum cost
network flow problem
np hard
network simplex algorithm
binary images
spanning tree
network flow
undirected graph
approximation algorithms
level set
minimal cost
graph mining
network design problem
minimum cost flow
itemsets
gray scale
np complete
mixed integer
optimal solution