Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2n)-time algorithm
Year: 2009
Type: conference-paper
Source: Symposium on Discrete Algorithms
Authors: Philip N. Klein, Shay Mozes, Oren Weimann
Institutions: Brown University, Massachusetts Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1900943336
