Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds

doi 10.1137/1.9781611975994.156
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

An Almost 2-Approximation for All-Pairs of Shortest Paths in Subquadratic Time

2020English

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

2007English

Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Bicriterion Shortest Paths in Stochastic Time-Dependent Networks

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
English

On Domain-Partitioning Induction Criteria: Worst-Case Bounds for the Worst-Case Based

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

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
2016English

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Tight Worst-Case Bounds for Polynomial Loop Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy