Fast Implementation of Dijkstra's Algorithm for the Large-Scale Shortest Path Problem

Transactions of the Operations Research Society of Japan

doi 10.15807/torsj.54.58

Full Text

Abstract

Available in

Date

January 1, 2011

Authors

Katsuki Fujisawa

Hiroshi Sasajima

Publisher

The Operations Research Society of Japan

Related search

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

English

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

Journal of Algorithms

English

A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem

Transportation Science

Structural Engineering

English

An Algorithm of Searching for the Shortest Path

English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems

English

An Associative Version of the Ramalingam Decremental Algorithm for the Dynamic All-Pairs Shortest-Path Problem

Bulletin of the Novosibirsk Computing Center. Series:Computer Science

English

An Improving Dynamic Programming Algorithm to Solve the Shortest Path Problem With Time Windows

Electronic Notes in Discrete Mathematics

Applied Mathematics

Discrete Mathematics

English

An Improved SPFA Algorithm for Single-Source Shortest Path Problem Using Forward Star Data Structure

International Journal of Managing Information Technology

English

Fast Fully Dynamic Landmark-Based Estimation of Shortest Path Distances in Very Large Graphs

English