Hi xor, Awesome! Thanks for sharing your work, I've been looking forward to that for quite some time ☺. I hope to dedicate some time to reading it in a month or so, once I finish my master's thesis. Now to answer your question:
Besides getting to know how WoT works, it would be of scientific benefit for > the project if you do read it: > The end of the thesis describes how the algorithm might be further > improved by > investigating what can be considered as a whole class of algorithms. I have > not heard about such a class of algorithms being identified and named by > science yet. But this might be merely due to lack of my knowledge. > I assume that this question relates to section 4.3.4 of your thesis. You're looking at the class of dynamic shortest-paths problems, more specifically the dynamic single-source shortest-paths problem. Note that in general, DSSSP is at least as hard as (static) all-pairs shortest paths [0]. However, WoT likely introduces a couple of constraints on the graph that allow for improved complexity bounds. You might find [0] an interesting read nonetheless. [0] Roditty, L., & Zwick, U. (2011). On dynamic shortest paths problems. *Algorithmica*, *61*(2), 389-401. Kind regards, Bert _______________________________________________ Devl mailing list [email protected] https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
