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
doi 10.31144/bncc.cs.2542-1972.2016.n39.p37-50
Full Text
Abstract

Available in full text

Date
Authors
Publisher

A.P. Ershov Institute of Informatics Systems SB RAS

Related search

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

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

Journal of Algorithms
1996English

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

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

An Algorithm of Searching for the Shortest Path

2017English

All-Pairs Shortest Path Algorithm Based on MPI+CUDA Distributed Parallel Programming Model

Journal of Networks
2013English

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

1989English

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

Transactions of the Operations Research Society of Japan
2011English

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy