Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Journal of Graph Algorithms and Applications - United States
doi 10.7155/jgaa.00240
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Journal of Graph Algorithms and Applications

Related search

Implementing Parallel Shortest-Paths Algorithms

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

2007English

On Finding and Updating Spanning Trees and Shortest Paths

SIAM Journal on Computing
MathematicsComputer Science
1975English

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms

2010English

Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

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

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

2020English

Competition for Shortest Paths on Sparse Graphs

Physical Review Letters
AstronomyPhysics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy