Relax and don't Stop: Graph-aware Asynchronous SSSP
Open Access
- 1 March 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 43-47
Abstract
No abstract availableFunding Information
- UK Research and Innovation (EP/X029174/1)
- Vetenskapsrådet (2021-05443)
- HORIZON EUROPE Marie Sklodowska-Curie Actions (101072456)
This publication has 19 references indexed in Scilit:
- Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite2020
- Julienne2017
- MultiQueues: Simple Relaxed Concurrent Priority Queues2015
- Direction-optimizing Breadth-First Search2012
- Optimized Routing for Large-Scale InfiniBand Networks2009
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global rolesProceedings of the National Academy of Sciences, 2005
- Δ-stepping: a parallelizable shortest path algorithmJournal of Algorithms, 2003
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958