Journal of Robotics and Machine Learning
Welcome to VerticalNews!
We're a pay-per-view site for premium content. If you'd like to purchase this article, it's only $3.00.
Research on algorithms published by scientists at La Sapienza University
June 30th, 2008
According to recent research published in the journal Algorithmica, "In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure."
"In particular, we devise a deterministic algorithm for general directed graphs that achieves O(n(2)) amortized time for updates, while preserving unit worst-case cost for queries. In case of deletions only, our algorithm performs updates faster in O(n) amortized time. We observe that fully dynamic transitive closure algorithms with O(1) query time maintain...
Click here for more articles from Algorithms
Source: Journal of Robotics and Machine Learning (2008-06-30)