Amanote Research

Amanote Research

    RegisterSign In

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

doi 10.1137/1.9781611972894.9
Full Text
Open PDF
Abstract

Available in full text

Date

January 3, 2009

Authors
Ulrich MeyerVitaly Osipov
Publisher

Society for Industrial and Applied Mathematics


Related search

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms

2010English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

A Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
2016English

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

Physarum Can Compute Shortest Paths

2012English

Implementing Parallel Shortest-Paths Algorithms

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Shortest-Paths Preserving Metro Maps

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Design and Implementation of Shortest Path Bridging for Network Simulator 3

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy