2007 | OriginalPaper | Buchkapitel
Associative Version of Italiano’s Decremental Algorithm for the Transitive Closure Problem
verfasst von : Anna Nepomniaschaya
Erschienen in: Parallel Computing Technologies
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a natural implementation of Italiano’s algorithm for updating the transitive closure of directed graphs after deletion of an edge on a model of associative (content addressable) parallel systems with vertical processing (the STAR–machine). The associative version of Italiano’s decremental algorithm is given as procedure
DeleteArc
, whose correctness is proved and time complexity is evaluated. We compare implementations of Italiano’s decremental algorithm and its associative version and enumerate the main advantages of the associative version.