Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph

zbMATH Open1249.68140MaRDI QIDQ2882945

A. Sh. Nepomnyaschaya

Publication date: 11 May 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

directed weighted graphassociative parallel machinesingle-sink shortest path problem

Mathematics Subject Classification ID

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

Related Items (1)

A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates

This page was built for publication: Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph

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