Communication complexity and graph families

DOI10.1145/3313234MaRDI QIDQ5205796zbMATH OpenOpenAlexFDO

Authors Sudeshna Kolay, Fahad Panolan, Saket Saurabh

Publication date 16 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3313234

zbMATH Keywords

communication complexityFPT algorithmsseparating family

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Communication complexity of pairs of graph families with applications
• scientific article; zbMATH DE number 6292585
• Some improved bounds on communication complexity via new decomposition of cliques
• The communication complexity of enumeration, elimination, and selection
• On covering graphs by complete bipartite subgraphs

Cited in

(3)

• Communication complexity in vertex partition whiteboard model
• scientific article; zbMATH DE number 5734944 (Why is no real title available?)
• Communication complexity of pairs of graph families with applications

This page was built for publication: Communication complexity and graph families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205796)