Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

Bringmann, Karl; Cassis, Alejandro; Fischer, Nick

doi:10.1109/FOCS57990.2023.00038

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons263580

Cassis, Alejandro
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.

フルテキスト (公開)

2304.05279.pdf
(プレプリント), 968KB

付随資料 (公開)

There is no public supplementary material available

引用

Bringmann, K., Cassis, A., & Fischer, N. (2023). Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! In IEEE 64th Annual Symposium on Foundations of Computer Science (pp. 515-538). Piscataway, NJ: IEEE.

引用: https://hdl.handle.net/21.11116/0000-000E-7585-8

要旨

要旨はありません