Max-cut and extendability of matchings in distance-regular graphs.

Sebastian M. Cioaba Jack H. Koolen Weiqiang Li

Published in: CoRR (2015)

Keyphrases

max cut
graph model
graph partitioning
planar graphs
np complete problems
spectral graph
np hard
distance measure
np complete
euclidean distance
min max
image segmentation
special case
pairwise similarities