scientific article; zbMATH DE number 6708339

MaRDI QIDQ2979859zbMATH OpenFDO

Authors A. Sh. Nepomnyaschaya

Publication date 26 April 2017

Full work available at URL http://bulletin.iis.nsk.su/files/article/nepomn.pdf

zbMATH Keywords

chordconnected componentfundamental set of circuitsminimum spanning treespanning treeundirected graphvertical processing system

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Constructions used in associative parallel algorithms for undirected graphs. I
• Parallel algorithms for a class of graphs generated recursively
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Parallel algorithms for cographs and parity graphs with applications
• scientific article; zbMATH DE number 3930349
• scientific article; zbMATH DE number 1057772
• scientific article; zbMATH DE number 4068310
• scientific article; zbMATH DE number 1985710
• An Asynchronous Parallel Algorithm for Undirected Graph Connectivity
• Parallel algorithms for parity graphs

Cited in

(6)

• Comparison of the Prim-Dijkstra and Kraskal algorithms on an associative parallel processor
• Efficient update of tree paths on associative systems with bit-parallel processing
• Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex
• Constructions used in associative parallel algorithms for undirected graphs. I
• scientific article; zbMATH DE number 2237504 (Why is no real title available?)
• An associative version of the Prim-Dijkstra algorithm and its application to some graph problems

This page was built for publication:

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