Shortest paths in directed planar graphs with negative lengths: A linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithm

Philip N. Klein, Shay Mozes, Oren Weimann. Shortest paths in directed planar graphs with negative lengths: A linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithm. ACM Transactions on Algorithms, 6(2), 2010. [doi]

Abstract

Abstract is missing.