Login / Signup

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

Sebastian M. CioabaJacobus H. KoolenWeiqiang Li
Published in: Eur. J. Comb. (2017)
Keyphrases
  • max cut
  • graph model
  • planar graphs
  • np hard
  • graph partitioning
  • np complete problems
  • spectral graph
  • distance measure
  • distance metric
  • multiscale
  • distance function
  • graph matching
  • metric learning
  • pairwise similarities