Shortest paths in directed planar graphs with negative lengths: a linear-space \emphO(\emphn log\(^\mbox2\) \emphn)-time algorithm. Klein, P. N., Mozes, S., & Weimann, O. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pages 236–245, 2009. SIAM.
Shortest paths in directed planar graphs with negative lengths: a linear-space \emphO(\emphn log\(^\mbox2\) \emphn)-time algorithm [link]Paper  bibtex   
@inproceedings{DBLP:conf/soda/KleinMW09,
  author    = {Philip N. Klein and
               Shay Mozes and
               Oren Weimann},
  editor    = {Claire Mathieu},
  title     = {Shortest paths in directed planar graphs with negative lengths: a
               linear-space \emph{O}(\emph{n} log\({}^{\mbox{2}}\) \emph{n})-time
               algorithm},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {236--245},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496797},
  timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/KleinMW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0