"On the Parallel Complexity of Digraph Reachability."

Samir Khuller, Uzi Vishkin (1994)

> Home

Details and statistics

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

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/KhullerV94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/KhullerV94
Samir Khuller, Uzi Vishkin:
On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. 52(5): 239-241 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.