On the parallel complexity of digraph reachability

DOI10.1016/0020-0190(94)00153-7zbMath0938.68945OpenAlexW1974462315MaRDI QIDQ1339381

Uzi Vishkin, Samir Khuller

Publication date: 21 June 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00153-7

Mathematics Subject Classification ID

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

Cites Work

• Matrix multiplication via arithmetic progressions
• Unnamed Item

This page was built for publication: On the parallel complexity of digraph reachability