An efficient parallel algorithm for the planar mincut linear arrangement problem for trees.

Published in: ISPAN (1997)

Keyphrases

parallel algorithm
binary search trees
min cut
energy minimization
mutual information
information theoretic
pairwise
cluster of workstations
image segmentation
lower bound
conditional random fields
graph partitioning
linear systems
semidefinite