日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

学術論文

A simple parallel algorithm for the single-source shortest path problem on planar digraphs

MPS-Authors
/persons/resource/persons45632

Träff,  Jesper Larsson
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45787

Zaroliagis,  Christos
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
引用

Träff, J. L., & Zaroliagis, C. (2000). A simple parallel algorithm for the single-source shortest path problem on planar digraphs. Journal of Parallel and Distributed Computing, 60(9), 1103-1124.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-3387-C
要旨
要旨はありません