Efficient implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors

MaRDI QIDQ3601405zbMATH OpenFDO

Authors A. Sh. Nepomnyaschaya

Publication date 10 February 2009

zbMATH Keywords

access data by contentsadjacency matrixassociative parallel processordecremental algorithmdirected graphincremental algorithmspanning treetransitive closure of a directed graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure
• An experimental study of dynamic algorithms for transitive closure
• A faster and simpler fully dynamic transitive closure
• scientific article; zbMATH DE number 2079364
• scientific article; zbMATH DE number 4083002

Cited in

(2)

• Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure
• Solution of graph problems by means of the STAR-machine being implemented on GPUs

This page was built for publication: Efficient implementation of the Italiano algorithms for updating the transitive closure on associative parallel processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601405)