Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time

URN:NBN:SI:doc-9OFEH90W2022Brodnik, AndrejGrgurovič, MarkoPožar, Rokdocuments/doc/9/URN_NBN_SI_doc-9OFEH90W_001.pdfdocuments/doc/9/URN_NBN_SI_doc-9OFEH90W_001.txt122articleP1.01 (str. 1-22)10.26493/1855-3974.2467.4971855-396661578243URN:NBN:SI:doc-9OFEH90WengUniverza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologijeArs mathematica contemporaneaBYall-pairs shortest pathsFloyd-Warshall algorithmFloyd-Warshallov algoritemnajkrajše poti med vsemi pari vozliščprobabilistic analysisverjetnostna analizaModifications of the Floyd-Warshall algorithm with nearly quadratic expected-time