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

Finding Shortest Paths With Computational Geometry

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

DOI10.7155/jgaa.00071zbMath1068.68105OpenAlexW2139500215MaRDI QIDQ4679070

Po-Shen Loh

Publication date: 25 May 2005

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51534


zbMATH Keywords

heuristic search algorithm


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)








This page was built for publication: Finding Shortest Paths With Computational Geometry

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