Node and edge relaxations of the Max-cut problem.

Svatopluk Poljak Franz Rendl

Published in: Computing (1994)

Keyphrases

disjoint paths
edge detection
undirected graph
lower bound
np hard
linear programming
tree structure
max cut
cross entropy
random graphs
edge map
edge information
edge weights
edge detector
graph structure
optimal path
directed graph
edge points
strongly connected
special case
multiscale