Year: 2017
Type: dissertation
Abstract: We study the shortest path problem in graphs.A new approach to solving the all-pairs shortest path problem is presented.The resulting algorithm makes better use of an arbitrary algorithm solving the single-source shortest path problem.This presents a significant improvement over the currently known approaches.We also identify a connection between the complexity of the single-source shortest path problem and a sorted variant of the all-pairs shortest path problem.This either suggests a simplification for future research on all-pairs shortest path algorithms or a way to prove a lower bound on the single-source shortest path problem.Last but not least, we define the some-pairs shortest path problem and give an algorithm that performs fewer basic operations than Floyd-Warshall.Grgurovič M. Najkrajše poti v krajšem času Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije, 2012 III Grgurovič M. Najkrajše poti v krajšem času Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije, 2012 IV 4 Novi algoritmi 4.1 Najkrajše poti med nekaterimi pari vozlišč . . . . . . . . . . . . . . . .4.2 Najkrajše poti med vsemi pari vozlišč . . . . . . . . . . . . . . . . . . .4.2.1 Definicije . . . . . .
Author: Grgurovič, Marko
Language: Slovenian
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7115422010
