English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
/persons/resource/persons230547

Rosenbaum,  Will
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Rosenbaum, W., & Suomela, J. (2020). Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Share on. In PODC'20 (pp. 89-98). New York, NY: ACM. doi:10.1145/3382734.3405721.


Cite as: http://hdl.handle.net/21.11116/0000-0007-9A54-D
Abstract
There is no abstract available