"The Space Complexity of Undirected Graph Exploration."

Yann Disser, Max Klimm (2022)

> Home

Details and statistics

DOI: 10.1007/978-3-031-21534-6_8

access: open

type: Part in Book or Collection

metadata version: 2023-02-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - books/sp/22/DisserK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/22/DisserK22
Yann Disser, Max Klimm:
The Space Complexity of Undirected Graph Exploration. Algorithms for Big Data 2022: 152-166

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.