Distributed Binary Labeling Problems in High-Degree Graphs
Pages 402 - 419
Abstract
Balliu et al. (DISC 2020) classified the hardness of solving binary labeling problems with distributed graph algorithms; in these problems the task is to select a subset of edges in a 2-colored tree in which white nodes of degree d and black nodes of degree have constraints on the number of selected incident edges. They showed that the deterministic round complexity of any such problem is , , or , or the problem is unsolvable. However, their classification only addresses complexity as a function of n; here hides constants that may depend on parameters d and . In this work we study the complexity of binary labeling problems as a function of all three parameters: n, d, and . To this end, we introduce the family of structurally simple problems, which includes, among others, all binary labeling problems in which cardinality constraints can be represented with a context-free grammar. We classify possible complexities of structurally simple problems. As our main result, we show that if the complexity of a problem falls in the broad class of , then the complexity for each d and is always either , , or . To prove our upper bounds, we introduce a new, more aggressive version of the rake-and-compress technique that benefits from high-degree nodes.
References
[1]
Balliu, A., et al.: Classification of distributed binary labeling problems. In: Attiya, H. (ed.) 34th International Symposium on Distributed Computing, DISC 2020, 12–16 October 2020, Virtual Conference. LIPIcs, vol. 179, pp. 17:1–17:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020).
[2]
Balliu, A., et al.: Classification of distributed binary labeling problems (2020). https://arxiv.org/abs/1911.13294
[3]
Balliu, A., Brandt, S., Olivetti, D., Suomela, J.: How much does randomness help with locally checkable problems? In: Emek, Y., Cachin, C. (eds.) PODC 2020: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, 3–7 August 2020, pp. 299–308. ACM (2020).
[4]
Balliu A, Brandt S, Olivetti D, and Suomela J Almost global problems in the LOCAL model Distrib. Comput. 2021 34 4 259-281
[5]
Balliu, A., Hirvonen, J., Korhonen, J.H., Lempiäinen, T., Olivetti, D., Suomela, J.: New classes of distributed time complexity. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25–29 June 2018, pp. 1307–1318. ACM (2018).
[6]
Balliu, A., et al.: Sinkless orientation made simple. In: Kavitha, T., Mehlhorn, K. (eds.) 2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, 23–25 January 2023, pp. 175–191. SIAM (2023).
[7]
Brandt, S., et al.: A lower bound for the distributed lovász local lemma. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18–21 June 2016, pp. 479–488. ACM (2016).
[8]
Chang YJ, Kopelowitz T, and Pettie S An exponential separation between randomized and deterministic complexity in the LOCAL model SIAM J. Comput. 2019 48 1 122-143
[9]
Chang YJ and Pettie S A time hierarchy theorem for the LOCAL model SIAM J. Comput. 2019 48 1 33-69
[10]
Fischer, M., Ghaffari, M.: Sublogarithmic distributed algorithms for lovász local lemma, and the complexity hierarchy. In: Richa, A.W. (ed.) 31st International Symposium on Distributed Computing, DISC 2017, Vienna, Austria, 16–20 October 2017. LIPIcs, vol. 91, pp. 18:1–18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017).
[11]
Füredi Z, Lazebnik F, Seress Á, Ustimenko VA, and Woldar AJ Graphs of prescribed girth and bi-degree J. Comb. Theory Ser. B 1995 64 2 228-239
[12]
Ghaffari, M., Harris, D.G., Kuhn, F.: On derandomizing local distributed algorithms. In: Thorup, M. (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7–9 October 2018, pp. 662–673. IEEE Computer Society (2018).
[13]
Ghaffari, M., Su, H.H.: Distributed degree splitting, edge coloring, and orientations. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16–19 January 2017, pp. 2505–2523. SIAM (2017).
[14]
Lievonen, H., Picavet, T., Suomela, J.: Distributed binary labeling problems in high-degree graphs (2023).
[15]
Linial N Locality in distributed graph algorithms SIAM J. Comput. 1992 21 1 193-201
[16]
Miller, G.L., Reif, J.H.: Parallel tree contraction and its application. In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21–23 October 1985, pp. 478–489. IEEE Computer Society (1985).
[17]
Naor M and Stockmeyer LJ What can be computed locally? SIAM J. Comput. 1995 24 6 1259-1277
[18]
Paun G and Salomaa A Thin and slender languages Disc. Appl. Math. 1995 61 3 257-270
[19]
Peleg D Distributed computing: a locality-sensitive approach Soc. Ind. Appl. Math. 2000
[20]
Rozhon, V., Ghaffari, M.: Polylogarithmic-time deterministic network decomposition and distributed derandomization. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22–26 June 2020, pp. 350–363. ACM (2020).
Recommendations
Distributed Maximum Matching in Bounded Degree Graphs
ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and NetworkingWe present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least (1−ϵ) times the optimal in ...
Labeling outerplanar graphs with maximum degree three
An L(2,1)-labeling of a graph G is an assignment of a non-negative integer to each vertex of G such that adjacent vertices receive integers that differ by at least two and vertices at distance two receive distinct integers. The span of such a labeling ...
Binary Labeling of Graphs
Let G = ( V , E ) be a graph. A mapping f : E ( G ) {0, l} m is called a mod 2 coding of G , if the induced mapping g : V ( G ) {0, l} m , defined as $$g(v) = \sum\limits_{u \in V,uv \in E} {f(uv)}$$ , assigns different vectors to the vertices of G . Note that all summations are mod ...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 27 May 2024
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025