𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simpler Computation of Single-Source Shortest Paths in Linear Average Time

✍ Scribed by Torben Hagerup

Book ID
105914834
Publisher
Springer
Year
2005
Tongue
English
Weight
163 KB
Volume
39
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Time–Work Tradeoffs of the Single-Source
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
✍ Hanmao Shi; Thomas H Spencer πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 111 KB

We give parallel algorithms that solve the single-source shortest paths problem Ε½ . on a weighted, undirected graph with n vertices and m edges in O t lg n time and Ε½Ε½ 3 2 . Ε½ . . Ε½ . Ε½ Ε½ 3 3 O n rt lg n lg nrt q m lg n work, or in O t lg n time and O n rt q . . mnrt lg n work for any t in the range

[Lecture Notes in Computer Science] Para
[Lecture Notes in Computer Science] Parallel Computing Technologies Volume 5698 || Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph
✍ Malyshkin, Victor πŸ“‚ Article πŸ“… 2009 πŸ› Springer Berlin Heidelberg 🌐 English βš– 188 KB

The PaCT-2009 (Parallel Computing Technologies) conference was a four-day eventheld in Novosibirsk. This was the tenth internationalconference to be held in the PaCT series. The conferences are held in Russia every odd year. The ?rst conference, PaCT 1991, was held in Novosibirsk (Academgorodok), Se