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

Authors:
Anna Nepomniaschaya
Affiliations:
(Correspd.) Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division of Russian Academy of Sciences, pr. Lavrentieva, 6, Novosibirsk, 630090, Russia. anep@ssd.sscc.ru
Venue:
Fundamenta Informaticae
Year:
2008

Citing 11
Cited 0

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
Parallel processing in cellular arrays

Parallel processing in cellular arrays
A simple implementation of Dijkstra's shortest path algorithm on associative parallel processors

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Content Addressable Parallel Processors

Content Addressable Parallel Processors
Representation of the Gabow Algorithm for Finding Smallest Trees with a Degree Constraint on Associative Parallel Processors

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Solution of Path Problems Using Associative Parallel Processors

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Fully dynamic biconnectivity and transitive closure

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Efficient Implementation of Edmonds' Algorithm for Finding Optimum Branchings on Associative Parallel Processors

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Associative version of italiano's decremental algorithm for the transitive closure problem

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a simple data structure for an efficient implementation of the Italiano algorithms for the dynamic updating of the transitive closure of a directed graph represented as adjacency matrix on a model of associative (or content addressable) parallel processors with vertical processing (the STAR-machine). Associative versions of the Italiano algorithms are represented as procedures DeleteArc1 and InsertArc1. We prove the correctness of these procedures and evaluate their time and space complexity. We also present the main advantages of associative versions of the Italiano algorithms.