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

Reconstructing shortest paths

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

DOI10.1007/BF02216928zbMath0705.90091OpenAlexW1965147690MaRDI QIDQ918442

Christopher B. Lofgren

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

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


zbMATH Keywords

shortest pathpolynomial-time algorithm


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)




Cites Work

  • Shortest path methods: A unifying approach
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Reconstructing shortest paths

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