Communication Complexity of Pairs of Graph Families with Applications

Sudeshna Kolay, Fahad Panolan, Saket Saurabh 0001. Communication Complexity of Pairs of Graph Families with Applications. In Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, editors, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark. Volume 83 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Abstract

Abstract is missing.