Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?

Avery Miller, Andrzej Pelc. Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?. In Christian Scheideler, Seth Gilbert, editors, Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. pages 377-386, ACM, 2016. [doi]

Abstract

Abstract is missing.