Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths.

Hung-Chun Liang Hsueh-I Lu

Published in: SIAM J. Discret. Math. (2017)

Keyphrases

shortest path
planar graphs
queueing systems
weighted graph
transition probabilities
shortest path algorithm
path length
travel time
minimum weight
minimum cost
finding the shortest path
scheduling problem
markov chain
approximate inference
geodesic distance