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

scientific article

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

zbMath0988.05088MaRDI QIDQ2768384

Ulrich Meyer

Publication date: 22 July 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sparse graphsshortest-paths algorithmsRAM algorithm


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (4)

Two-level heaps: a new priority queue structure with applications to the single source shortest path problem ⋮ A faster algorithm for the single source shortest path problem with few distinct positive lengths ⋮ Engineering Route Planning Algorithms ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing







This page was built for publication:

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