Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graph transformation approach for the shortest path search and length calculation

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

zbMATH Open1270.05094MaRDI QIDQ2844199FDOQ2844199


Authors: Masao Mori, Yoshihiro Mizoguchi Edit this on Wikidata


Publication date: 28 August 2013

Published in: Bulletin of Informatics and Cybernetics (Search for Journal in Brave)





Recommendations

  • scientific article; zbMATH DE number 124663
  • Computing the shortest path: \(A^\ast\) search meets graph theory
  • scientific article; zbMATH DE number 6280003
  • An efficient Dijkstra-like labeling method for computing shortest odd/even paths
  • Shortest path methods: A unifying approach


zbMATH Keywords

shortest pathgraph transformationsedge lengthedge labels


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)







This page was built for publication: Graph transformation approach for the shortest path search and length calculation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844199)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2844199&oldid=15771263"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:21. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki