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]
@article{KleinMW10,
title = {Shortest paths in directed planar graphs with negative lengths: A linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithm},
author = {Philip N. Klein and Shay Mozes and Oren Weimann},
year = {2010},
doi = {10.1145/1721837.1721846},
url = {http://doi.acm.org/10.1145/1721837.1721846},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KleinMW10},
cites = {0},
citedby = {0},
journal = {ACM Transactions on Algorithms},
volume = {6},
number = {2},
}