A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices

DOI10.1109/12.663776zbMath1392.68197OpenAlexW2145413351MaRDI QIDQ4571450

Michael Barbehenn

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.663776

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (5)

A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks ⋮ Heuristic search of optimal machine teaching curricula ⋮ HILS setup of dynamic flight path planning in 3D environment with flexible mission planning using ground station ⋮ The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut ⋮ Histogram-based embedding for learning on statistical manifolds

This page was built for publication: A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices