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

Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints

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

DOI10.1016/0925-2312(94)00018-NzbMath0833.68098OpenAlexW1999038551MaRDI QIDQ1898910

James C. Perry, Jeffrey L. Solka, Brian R. Poellinger, George W. Rogers

Publication date: 25 September 1995

Published in: Neurocomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-2312(94)00018-n


zbMATH Keywords

route planningartificial neural systemoptimal path algorithm


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)








This page was built for publication: Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1898910&oldid=14306985"
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 13:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki