Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time.

Jakub Lacki Piotr Sankowski

Published in: ESA (2011)

Keyphrases

planar graphs
shortest path
minimum weight
approximate inference
undirected graph
weighted graph
optimal solution
training set
bipartite graph
boundary points