"Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems."

Will Rosenbaum, Jukka Suomela (2020)

> Home

Details and statistics

DOI: 10.1145/3382734.3405721

access: closed

type: Conference or Workshop Paper

metadata version: 2020-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/podc/RosenbaumS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/RosenbaumS20
Will Rosenbaum, Jukka Suomela:
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. PODC 2020: 89-98

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.