Implementing Parallel Shortest-Paths Algorithms

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
doi 10.1090/dimacs/030/04
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society

Related search

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms

2010English

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

2007English

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2011English

Shortest Gently Descending Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Physarum Can Compute Shortest Paths

2012English

Shortest-Paths Preserving Metro Maps

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Connectivity-Optimal Shortest Paths Using Crowdsourced Data

2016English

Competition for Shortest Paths on Sparse Graphs

Physical Review Letters
AstronomyPhysics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy