Associative version of italiano's decremental algorithm for the transitive closure problem

Authors:
Anna Nepomniaschaya
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division of the Russian Academy of Sciences, Novosibirsk, Russia
Venue:
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Year:
2007

Citing 7
Cited 2

Amortized efficiency of a path retrieval data structure

Theoretical Computer Science
Finding paths and deleting edges in directed acyclic graphs

Information Processing Letters
Maintenance of transitive closures and transitive reductions of graphs

Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Content Addressable Parallel Processors

Content Addressable Parallel Processors
An Experimental Study of Dynamic Algorithms for Directed Graphs

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Fully dynamic biconnectivity and transitive closure

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors

Fundamenta Informaticae

Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

Fundamenta Informaticae
Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.