Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time

Christian Wulff-Nilsen

Published in: CoRR (2009)

Keyphrases

edge weights
weighted graph
shortest path
worst case
lower bound
directed graph
bayesian networks
higher order
bipartite graph
superpixels
minimum weight
satisfy the triangle inequality