Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time

Jakub Lacki Piotr Sankowski

Published in: CoRR (2011)

Keyphrases

planar graphs
lower bound
shortest path
worst case
approximate inference
probability distribution
minimum weight
bayesian networks
special case
model selection
belief propagation
weighted graph
binary variables