Open AccessA faster algorithm for the single source shortest path problem with few distinct positive lengths
Author(s) -
Matthew D. Williamson
Publication year - 2019
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.33915/etd.4551
Subject(s) - dijkstra's algorithm , shortest path problem , suurballe's algorithm , yen's algorithm , shortest path faster algorithm , algorithm , enhanced data rates for gsm evolution , combinatorics , k shortest path routing , path (computing) , path length , mathematics , graph , floyd–warshall algorithm , graph traversal , computer science , discrete mathematics , artificial intelligence , computer network , programming language