Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Improved algorithms for dynamic shortest paths

From MaRDI portal
Publication:1586136
Jump to:navigation, search

DOI10.1007/s004530010043zbMath0963.68225OpenAlexW2094724468MaRDI QIDQ1586136

Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis

Publication date: 14 November 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010043


zbMATH Keywords

planar digraphs


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)


Related Items (4)

A dynamic topological sort algorithm for directed acyclic graphs ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ Dynamic algorithms for shortest paths in planar graphs ⋮ Unnamed Item




This page was built for publication: Improved algorithms for dynamic shortest paths

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1586136&oldid=13873752"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki