Login / Signup

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.

Glencora BorradailePiotr SankowskiChristian Wulff-Nilsen
Published in: FOCS (2010)
Keyphrases
  • planar graphs
  • preprocessing
  • post processing
  • minimum weight
  • closed form
  • markov random field
  • approximate inference
  • higher order
  • point correspondences
  • undirected graph