Randomized graph data-structures for approximate shortest path problem

Baswana, Surender; Sen, Sandeep; Sahni, Sartaj; Mehta, Dinesh

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

書籍の一部

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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2911-B

要旨

要旨はありません