"On the Parallel Complexity of Digraph Reachability."

Samir Khuller, Uzi Vishkin (1994)

Details and statistics

DOI: 10.1016/0020-0190(94)00153-7

access: closed

type: Journal Article

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics