This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008. The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.This algorithm works faster than the Bellman-Ford method under the similarity as- sumption, i.e., when W = O(poly(n)). The complexity results for the SSSP problem with negative edge weights are summarized in Table 5. ... His result has been improved several times since then, the results are summarized in the Table 6.
|Title||:||Mathematical Foundations of Computer Science 2008|
|Author||:||Edward Ochmanski, Jerzy Tyszkiewicz|
|Publisher||:||Springer Science & Business Media - 2008-08-12|