English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Book Chapter

Randomized graph data-structures for approximate shortest path problem

MPS-Authors
/persons/resource/persons44080

Baswana,  Surender
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45456

Sen,  Sandeep
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Baswana, S., & Sen, S. (2004). Randomized graph data-structures for approximate shortest path problem. In S. Sahni, & D. Mehta (Eds.), Handbook of Data Structures and Applications (pp. 38.1-38.19). Boca Raton, USA: Chapman & Hall/CRC.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2911-B
Abstract
There is no abstract available