On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract

Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald. On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 956-965, SIAM, 2019. [doi]

Abstract

Abstract is missing.