## Abstract

We give an O(n log^{2} n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes. The best previously known algorithm requires O(n log^{3} n) time and O(n log n) space.

Original language | English |
---|---|

Title of host publication | Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms |

Pages | 236-245 |

Number of pages | 10 |

State | Published - 2009 |

Externally published | Yes |

Event | 20th Annual ACM-SIAM Symposium on Discrete Algorithms - New York, NY, United States Duration: 4 Jan 2009 → 6 Jan 2009 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|

### Conference

Conference | 20th Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|

Country/Territory | United States |

City | New York, NY |

Period | 4/01/09 → 6/01/09 |

## ASJC Scopus subject areas

- Software
- Mathematics (all)

## Fingerprint

Dive into the research topics of 'Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log^{2}n)-time algorithm'. Together they form a unique fingerprint.