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.
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
{"_id":"zjfudzhsAaJjm47wL","bibbaseid":"klein-mozes-weimann-shortestpathsindirectedplanargraphswithnegativelengthsalinearspaceemphoemphnlogmbox2emphntimealgorithm-2009","author_short":["Klein, P. N.","Mozes, S.","Weimann, O."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Philip","N."],"propositions":[],"lastnames":["Klein"],"suffixes":[]},{"firstnames":["Shay"],"propositions":[],"lastnames":["Mozes"],"suffixes":[]},{"firstnames":["Oren"],"propositions":[],"lastnames":["Weimann"],"suffixes":[]}],"editor":[{"firstnames":["Claire"],"propositions":[],"lastnames":["Mathieu"],"suffixes":[]}],"title":"Shortest paths in directed planar graphs with negative lengths: a linear-space \\emphO(\\emphn log\\(^\\mbox2\\) \\emphn)-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","bibtex":"@inproceedings{DBLP:conf/soda/KleinMW09,\n author = {Philip N. Klein and\n Shay Mozes and\n Oren Weimann},\n editor = {Claire Mathieu},\n title = {Shortest paths in directed planar graphs with negative lengths: a\n linear-space \\emph{O}(\\emph{n} log\\({}^{\\mbox{2}}\\) \\emph{n})-time\n algorithm},\n booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete\n Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},\n pages = {236--245},\n publisher = {{SIAM}},\n year = {2009},\n url = {http://dl.acm.org/citation.cfm?id=1496770.1496797},\n timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},\n biburl = {https://dblp.org/rec/conf/soda/KleinMW09.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Klein, P. N.","Mozes, S.","Weimann, O."],"editor_short":["Mathieu, C."],"key":"DBLP:conf/soda/KleinMW09","id":"DBLP:conf/soda/KleinMW09","bibbaseid":"klein-mozes-weimann-shortestpathsindirectedplanargraphswithnegativelengthsalinearspaceemphoemphnlogmbox2emphntimealgorithm-2009","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?id=1496770.1496797"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/93/2346.bib","dataSources":["gzaiqt38X7DKLvHXK"],"keywords":[],"search_terms":["shortest","paths","directed","planar","graphs","negative","lengths","linear","space","empho","emphn","log","mbox2","emphn","time","algorithm","klein","mozes","weimann"],"title":"Shortest paths in directed planar graphs with negative lengths: a linear-space \\emphO(\\emphn log\\(^\\mbox2\\) \\emphn)-time algorithm","year":2009}