Shortest path computations in source-deplanarized graphs
From MaRDI portal
Publication:685480
DOI10.1016/0020-0190(93)90227-ZzbMath0776.68056OpenAlexW2087205405MaRDI QIDQ685480
Hung-Yi Tu, Susanne E. Hambrusch, Greg N. Frederickson
Publication date: 17 October 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90227-z
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- A framework for 1-D compaction with forbidden region avoidance
- A mixed-integer linear programming problem which is efficiently solvable
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Fibonacci heaps and their uses in improved network optimization algorithms
This page was built for publication: Shortest path computations in source-deplanarized graphs
