Efficient update of tree paths on associative systems with bit-parallel processing

MaRDI QIDQ2880590zbMATH OpenFDO

Authors A. Sh. Nepomnyaschaya

Publication date 13 April 2012

Published in Joint Bulletin of the Novosibirsk Computing Center (NCC) and A. P. Ershov Institute of Informatics Systems (IIS). Series: Computer Science (Search for Journal in Brave)

zbMATH Keywords

end-pointminimum spanning treeundirected graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2237504
• Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc
• Decremental associative algorithm for updating the shortest paths tree
• scientific article; zbMATH DE number 6708339
• Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph

Cited in

(3)

• Efficient associative algorithms for implementing the second group of relational algebra operations
• scientific article; zbMATH DE number 1951565 (Why is no real title available?)
• scientific article; zbMATH DE number 2237504 (Why is no real title available?)

This page was built for publication: Efficient update of tree paths on associative systems with bit-parallel processing

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