Login / Signup

A Multi-Terminal Minimum Cut Algorithm for Planar Graphs.

Yossi Shiloach
Published in: SIAM J. Comput. (1980)
Keyphrases
  • minimum cut
  • maximum flow
  • np hard
  • planar graphs
  • k means
  • worst case
  • dynamic programming
  • clustering algorithm
  • probabilistic model
  • higher order
  • convex hull
  • data clustering
  • graph partitioning
  • minimum spanning tree