• Home
  • Search
  • Improved distributed algorithms for exact shortest paths
  • Open Access IconOpen Access
  • Cite Icon79
  • https://doi.org/10.1145/3188745.3188948Copy DOI Icon

Improved distributed algorithms for exact shortest paths

  • Jun 20, 2018
  • Mohsen Ghaffari +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Henzinger, Krinninger, and Nanongkai [STOC’16] which deterministically computes (1+o(1))-approximate shortest paths in Õ(D+√n) time, where D is the hop-diameter of the graph. Up to logarithmic factors, this time complexity is optimal, matching the lower bound of Elkin [STOC’04].

Similar Papers
  • Research Article
  • Citations25

An effective heuristic for computing many shortest path alternatives in road networks

  • Jun 01, 2012
  • International Journal of Geographical Information Science
  • Stéphanie Vanhove +1
  • Conference Article
  • Citations83

Deterministic decremental single source shortest paths: beyond the o(mn) bound

  • Jun 19, 2016
  • Aaron Bernstein +1
  • Research Article
  • Citations1

Labeling methods for partially ordered paths

  • May 03, 2024
  • European Journal of Operational Research
  • Ricardo Euler +1
  • Conference Article
  • Citations1

A linear time pre-processing for optimization of shortest path and distance algorithms

  • Aug 01, 2017
  • Neeta A Eapen +1
  • Research Article
  • Citations18

An efficient parallel algorithm for shortest paths in planar layered digraphs

  • Oct 01, 1995
  • Algorithmica
  • S Subramanian +2
  • Research Article
  • Citations22

A Multiple Pairs Shortest Path Algorithm

  • Nov 01, 2005
  • Transportation Science
  • I-Lin Wang +2
  • Conference Article
  • Citations71

Distributed exact shortest paths in sublinear time

  • Jun 19, 2017
  • Michael Elkin
  • Research Article

Public conveyance system for shortest path nding for real road network

  • Sep 03, 2015
  • Figshare
  • Journals Iosr +4
  • Conference Article
  • Citations3

GPU implementation of all pairs shortest path algorithm for graphs using triangular matrix method

  • Jan 01, 2017
  • S Umamaheswari +1
  • Research Article
  • Citations16

Termination Detection for Parallel Shortest Path Algorithms

  • Dec 01, 1998
  • Journal of Parallel and Distributed Computing
  • Michelle R Hribar +2
  • Conference Article
  • Citations28

All-pairs bottleneck paths in vertex weighted graphs

  • Jan 07, 2007
  • A Shapira +2
  • Conference Article
  • Citations5

High-Speed Shortest Path Co-processor Design

  • Jan 01, 2009
  • Mohd Yamani Idna Idris +4
  • Conference Article
  • Citations30

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs

  • Mar 04, 2010
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Neelesh Khanna +1
  • Conference Article
  • Citations17

Research of shortest path algorithm based on the data structure

  • Jun 01, 2012
  • Jinhao Lu +1
  • Conference Article
  • Citations2

Reserved delivery subnetwork configuration algorithm with the maximum sharing shortest path tree

  • Aug 06, 2003
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Ruibiao Qiu
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.