Technical Note—Reducing Space Requirements for Shortest Path Problems

DOI10.1287/OPRE.30.5.1009MaRDI QIDQ3955179zbMATH OpenOpenAlexFDO

Authors J. Ian Munro, Raul J. Ramirez

Publication date 1982

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.30.5.1009

zbMATH Keywords

dropping networkslayered networkmidpoint methodminimal storageshortest path problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(2)

• Finding minimum area \(k\)-gons
• Memory efficient algorithms for cactus graphs and block graphs

This page was built for publication: Technical Note—Reducing Space Requirements for Shortest Path Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3955179)