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

DOI10.7155/jgaa.00240zbMath1276.05110OpenAlexW2103678784MaRDI QIDQ2865044

Yajun Wang, Wolfgang Mulzer, Tetsuo Asano

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00240

zbMATH Keywords

computing instead of storingsimulated parallelization

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Memory-constrained algorithms for simple polygons ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ A new balanced subdivision of a simple polygon for time-space trade-off algorithms ⋮ Constant work-space algorithms for facility location problems ⋮ Space-time trade-offs for stack-based algorithms ⋮ A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon ⋮ Memory efficient algorithms for cactus graphs and block graphs

Uses Software

• LEDA

This page was built for publication: Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons