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

Will Rosenbaum, Jukka Suomela. Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. In Yuval Emek, Christian Cachin, editors, PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020. pages 89-98, ACM, 2020. [doi]

Abstract

Abstract is missing.