Login / Signup

Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time.

Ivona BezákováAdam J. Friedlander
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • planar graphs
  • weighted graph
  • minimum weight
  • random sampling
  • monte carlo
  • belief propagation
  • approximate inference
  • sample size
  • spanning tree
  • undirected graph