"Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs."

Shahbaz Khan (2019)

> Home

Details and statistics

DOI: 10.1145/3364212

access: closed

type: Journal Article

metadata version: 2020-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/topc/Khan19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/topc/Khan19
Shahbaz Khan:
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. ACM Trans. Parallel Comput. 6(3): 18:1-18:33 (2019)

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.