✦ LIBER ✦

Average update times for fully-dynamic all-pairs shortest paths

✍ Scribed by Tobias Friedrich; Nils Hebbinghaus

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NC algorithms for dynamically solving th

✍ Weifa Liang; Brendan D. McKay; Hong Shen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 728 KB

A simplified algorithm for the all pairs

✍ Tadao Takaoka 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 415 KB

AnO(n3(log log n/log n)5/4) Time Algorit

✍ Yijie Han 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 228 KB

A mean-time comparison of algorithms for

✍ W. D. Kelton; A. M. Law 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

A New Algorithm for Finding All Shortest

✍ Spira, P. M. 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 509 KB