Abstract
Given a graph G and a pair (F1, F2) of graph families, the function GDISJG,F1,F2 takes as input, two induced subgraphs G1 and G2 of G, such that G1 ∈ F1 and G2 ∈ F2 and returns 1 if V(G1)∩ V(G2)=∅ and 0 otherwise. We study the communication complexity of this problem in the two-party model. In particular, we look at pairs of hereditary graph families. We show that the communication complexity of this function, when the two graph families are hereditary, is sublinear if and only if there are finitely many graphs in the intersection of these two families. Then, using concepts from parameterized complexity, we obtain nuanced upper bounds on the communication complexity of GDISJG, F1, F2. A concept related to communication protocols is that of a (F1, F2)-separating family of a graph G. A collection F of subsets of V(G) is called a (F1,F2)-separating family for G, if for any two vertex disjoint induced subgraphs G1∈ F1,G2∈ F2, there is a set F ∈ F with V(G1) ⊆ F and V(G2) ∩ F = ∅. Given a graph G on n vertices, for any pair (F1,F2) of hereditary graph families with sublinear communication complexity for GDISJG,F1,F2, we give an enumeration algorithm that finds a subexponential sized (F1,F2)-separating family. In fact, we give an enumeration algorithm that finds a 2o(k)nO(1) sized (F1,F2)-separating family, where k denotes the size of a minimum sized set S of vertices such that V(G)\ S has a bipartition (V1,V2) with G[V1] ∈ F1 and G[V2]∈ F2. We exhibit a wide range of applications for these separating families, to obtain combinatorial bounds, enumeration algorithms, as well as exact and FPT algorithms for several problems.
- Kazuyuki Amano. 2014. Some improved bounds on communication complexity via new decomposition of cliques. Discr. Appl. Math. 166 (2014), 249--254.Google ScholarDigital Library
- Julien Baste, Luerbio Faria, Sulamita Klein, and Ignasi Sau. 2015. Parameterized complexity dichotomy for (r, l)-vertex deletion. CoRR abs/1504.05515 (2015). http://arxiv.org/abs/1504.05515Google Scholar
- Nicolas Bousquet, Aurélie Lagoutte, and Stéphan Thomassé. 2014. Clique versus independent set. Eur. J. Comb. 40 (2014), 73--92.Google ScholarCross Ref
- J. M. Byskov. 2004. Exact algorithms for graph colouring and exact satisfiability. Ph.D. thesis. University of Aarhus.Google Scholar
- Jianer Chen, Iyad A. Kanj, and Ge Xia. 2010. Improved upper bounds for vertex cover. Theor. Comput. Sci. 411, 40-42 (2010), 3736--3756. Google ScholarDigital Library
- Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms. Springer. Google ScholarDigital Library
- Marek Cygan and Marcin Pilipczuk. 2013. Split vertex deletion meets vertex cover: New fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. 113, 5-6 (2013), 179--182. Google ScholarDigital Library
- R. Diestel. 2000. Graph Theory (2nd ed., electronic ed.). Springer, Berlin.Google Scholar
- Tomas Feder, Pavol Hell, Sulamita Klein, and Rajeev Motwani. 1999. Complexity of graph partition problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC’99). ACM, New York, 464--472. Google ScholarDigital Library
- Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, and Igor Razgon. 2008. On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52, 2 (2008), 293--307. Google ScholarDigital Library
- Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. 2012. Planar F-deletion: Approximation, kernelization and optimal FPT algorithms. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS’12). 470--479. Google ScholarDigital Library
- Mika Göös. 2015. Lower bounds for clique vs. independent set. In Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS’15). 1066--1076. Google ScholarDigital Library
- Mika Göös, T. S. Jayram, Toniann Pitassi, and Thomas Watson. 2018. Randomized communication versus partition number. ACM Trans. Comput. Theory 10, 1, Article 4 (Jan. 2018), 20 pages. Google ScholarDigital Library
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2015. Deterministic communication vs. partition number. In Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS’15). 1077--1088. Google ScholarDigital Library
- Vince Grolmusz and Gábor Tardos. 2003. A note on non-deterministic communication complexity with few witnesses. Theory Comput. Syst. 36, 4 (2003), 387--391.Google ScholarCross Ref
- Sushmita Gupta, Venkatesh Raman, and Saket Saurabh. 2012. Maximum r-regular induced subgraph problem: Fast exponential algorithms and combinatorial bounds. SIAM J. Discrete Math. 26, 4 (2012), 1758--1780.Google ScholarCross Ref
- Hao Huang and Benny Sudakov. 2012. A counterexample to the Alon-Saks-Seymour conjecture and related problems. Combinatorica 32, 2 (2012), 205--219. Google ScholarDigital Library
- Bart M. P. Jansen, Daniel Lokshtanov, and Saket Saurabh. 2014. A near-optimal planarization algorithm. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’14). 1802--1811. Google ScholarDigital Library
- Tomasz Kociumaka and Marcin Pilipczuk. 2014. Faster deterministic feedback vertex set. Inf. Process. Lett. 114, 10 (2014), 556--560. Google ScholarDigital Library
- Sudeshna Kolay and Fahad Panolan. 2015. Parameterized algorithms for deletion to (r,l)-graphs. In Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS’15). 420--433.Google Scholar
- Sudeshna Kolay, Fahad Panolan, and Saket Saurabh. 2017. Communication complexity of pairs of graph families with applications. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS’17). 13:1--13:13.Google Scholar
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press, New York. Google ScholarDigital Library
- Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, and Saket Saurabh. 2014. Faster parameterized algorithms using linear programming. ACM Trans. Algorithms 11, 2 (2014), 15. Google ScholarDigital Library
- László Lovász. 1990. Communication complexity: A survey. Paths, flows, and VLSI-layout. Princeton University Press, 235--265.Google Scholar
- László Lovász. 1994. Stable sets and polynomials. Discrete Math. 124, 1–3 (1994), 137--153. Google ScholarDigital Library
- J. W. Moon and L. Moser. 1965. On cliques in graphs. Isr. J. Math. 3, 1 (1965), 23--28.Google ScholarCross Ref
- Rolf Niedermeier and Peter Rossmanith. 2003. An efficient fixed-parameter algorithm for 3-hitting set. J. Discrete Algorithms 1, 1 (2003), 89--102. Combinatorial Algorithms. Google ScholarDigital Library
- Marcin Pilipczuk and Michal Pilipczuk. 2012. Finding a maximum induced degenerate subgraph faster than 2 n. In Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC’12). 3--12. Google ScholarDigital Library
- Manami Shigeta and Kazuyuki Amano. 2015. Ordered biclique partitions and communication complexity problems. Discrete Appl. Math. 184 (2015), 248--252. Google ScholarDigital Library
- Mihalis Yannakakis. 1991. Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43, 3 (1991), 441--466.Google ScholarCross Ref
- Andrew Chi-Chih Yao. 1979. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC’79). ACM, New York, 209--213. Google ScholarDigital Library
Index Terms
- Communication Complexity and Graph Families
Recommendations
Parameterized complexity of even/odd subgraph problems
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a @P-graph for @P-graphs being one of the following four classes of graphs: Eulerian graphs, even graphs, ...
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
We study the problem of finding small s---t separators that induce graphs having certain properties. It is known that finding a minimum clique s---t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221---232, 1985), while for example ...
Split clique graph complexity
A complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by C(G) the clique family of G. The clique graph of G, denoted by K(G), is the intersection graph of C(G). Say that G is a ...
Comments