A sharper analysis of a prallel algorithm for the all pairs shortest path problem

DOI10.1016/0167-8191(90)90159-7zbMath0707.68045OpenAlexW2008169560MaRDI QIDQ919832

Tadao Takaoka, Qian-Ping Gu

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90159-7

zbMATH Keywords

all pairs shortest path problemdirected complete graphrepeated ``plus-min algorithmSIMD-SM-RW computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

This page was built for publication: A sharper analysis of a prallel algorithm for the all pairs shortest path problem