Generating partitions of a graph into a fixed number of minimum weight cuts.

Gerhard Reinelt Klaus Michael Wenger

Published in: Discret. Optim. (2010)

Keyphrases

fixed number
minimum weight
bipartite graph
weighted graph
spanning tree
maximum weight
minimum spanning tree
maximum cardinality
greedy heuristic
edge weights
planar graphs
finite number
special case
randomized algorithm
evolutionary algorithm