"On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs."

Lisa Hellerstein, Philip N. Klein, Robert Wilber (1990)

> Home

Details and statistics

DOI: 10.1016/0020-0190(90)90055-3

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/HellersteinKW90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/HellersteinKW90
Lisa Hellerstein, Philip N. Klein, Robert Wilber:
On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. Inf. Process. Lett. 35(5): 261-267 (1990)

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.