Highway Dimension, Shortest Paths, and Provably Efficient Algorithms

doi 10.1137/1.9781611973075.64
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Implementing Parallel Shortest-Paths Algorithms

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Computing Many-To-Many Shortest Paths Using Highway Hierarchies

2007English

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

2007English

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

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Shortest Gently Descending Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Design and Implementation of a Practical I/O-Efficient Shortest Paths Algorithm

2009English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

Physarum Can Compute Shortest Paths

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy