"An O(log(n)4/3) space algorithm for (s, t) ..."

Roy Armoni et al. (2000)

> Home

Details and statistics

DOI: 10.1145/333979.333984

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/ArmoniTWZ00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/ArmoniTWZ00
Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou:
An O(log(n)^4/3) space algorithm for (s, t) connectivity in undirected graphs. J. ACM 47(2): 294-311 (2000)

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.