Login / Signup

Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.

Lisa Fleischer
Published in: IPCO (1998)
Keyphrases
  • symbolic representation
  • machine learning
  • object recognition
  • higher level
  • minimum cost
  • multimedia
  • search algorithm
  • worst case
  • run times