Heterogeneous blocked all-pairs shortest paths algorithm for clustered weighted graphs

MaRDI QIDQ6859667zbMATH OpenFDO

Authors Anatoliĭ Alekseevich Prikhozhiĭ, Oleg Nikolaevich Karasik

Publication date 11 February 2026

Published in Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://journals.bsu.by/index.php/mathematics/en/article/view/7156

zbMATH Keywords

all-pairs shortest pathsblocked algorithmclustered weighted large graphheterogeneous computationsspeedup

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A blocked all-pairs shortest-paths algorithm
• A Theorem on Boolean Matrices
• Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams

This page was built for publication: Heterogeneous blocked all-pairs shortest paths algorithm for clustered weighted graphs

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