Communication complexity of pairs of graph families with applications
From MaRDI portal
Publication:5111227
DOI10.4230/LIPICS.MFCS.2017.13zbMATH Open1441.68052OpenAlexW2774463688MaRDI QIDQ5111227FDOQ5111227
Authors: Sudeshna Kolay, Fahad Panolan, Saket Saurabh 
Publication date: 26 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.13
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27) Communication complexity, information complexity (68Q11)
Cites Work
- Expressing combinatorial optimization problems by linear programs
- Stable sets and polynomials
- Clique versus independent set
- Title not available (Why is that?)
- Parameterized Algorithms
- Communication Complexity
- Complexity of graph partition problems
- Title not available (Why is that?)
- A note on non-deterministic communication complexity with few witnesses
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
- Ordered biclique partitions and communication complexity problems
- Some improved bounds on communication complexity via new decomposition of cliques
- Deterministic Communication vs. Partition Number
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Communication complexity of pairs of graph families with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111227)
