Document Open Access Logo

Locally Computing Edge Orientations

Authors Slobodan Mitrović, Ronitt Rubinfeld, Mihir Singhal

PDF
Thumbnail PDF

File

LIPIcs.ESA.2024.89.pdf
  • Filesize: 0.73 MB
  • 17 pages

Document Identifiers

Author Details

Slobodan Mitrović
  • University of California, Davis, CA, USA
Ronitt Rubinfeld
  • Massachusetts Institute of Technology, Cambridge, MA, USA
Mihir Singhal
  • University of California, Berkeley, CA, USA

Cite AsGet BibTex

Slobodan Mitrović, Ronitt Rubinfeld, and Mihir Singhal. Locally Computing Edge Orientations. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 89:1-89:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024.89

Abstract

We consider the question of orienting the edges in a graph G such that every vertex has bounded out-degree. For graphs of arboricity α, there is an orientation in which every vertex has out-degree at most α and, moreover, the best possible maximum out-degree of an orientation is at least α - 1. We are thus interested in algorithms that can achieve a maximum out-degree of close to α. A widely studied approach for this problem in the distributed algorithms setting is a "peeling algorithm" that provides an orientation with maximum out-degree α(2+ε) in a logarithmic number of iterations. We consider this problem in the local computation algorithm (LCA) model, which quickly answers queries of the form "What is the orientation of edge (u,v)?" by probing the input graph. When the peeling algorithm is executed in the LCA setting by applying standard techniques, e.g., the Parnas-Ron paradigm, it requires Ω(n) probes per query on an n-vertex graph. In the case where G has unbounded degree, we show that any LCA that orients its edges to yield maximum out-degree r must use Ω(√ n/r) probes to G per query in the worst case, even if G is known to be a forest (that is, α = 1). We also show several algorithms with sublinear probe complexity when G has unbounded degree. When G is a tree such that the maximum degree Δ of G is bounded, we demonstrate an algorithm that uses Δ n^{1-log_Δ r + o(1)} probes to G per query. To obtain this result, we develop an edge-coloring approach that ultimately yields a graph-shattering-like result. We also use this shattering-like approach to demonstrate an LCA which 4-colors any tree using sublinear probes per query.

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • local computation algorithms
  • edge orientation
  • tree coloring

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. N. Ailon, B. Chazelle, S. Comandur, and D. Liu. Property-preserving data reconstruction. Algorithmica, 51(2):160-182, 2008. Google Scholar
  2. Noga Alon. A parallel algorithmic version of the local lemma. Random Structures & Algorithms, 2(4):367-378, 1991. Google Scholar
  3. Noga Alon, Ronitt Rubinfeld, Shai Vardi, and Ning Xie. Space-efficient local computation algorithms. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 1132-1139. SIAM, 2012. Google Scholar
  4. Sanjeev Arora and Madhu Sudan. Improved low-degree testing and its applications. Combinatorica, 23(3):365-426, 2003. Google Scholar
  5. Rubi Arviv, Lily Chung, Reut Levi, and Edward Pyne. Improved local computation algorithms for constructing spanners. In APPROX-RANDOM, volume 275, pages 42:1-42:23, 2023. Google Scholar
  6. Pranjal Awasthi, Madhav Jha, Marco Molinaro, and Sofya Raskhodnikova. Limitations of local filters of lipschitz and monotone functions. In APPROX-RANDOM, pages 374-386, 2012. Google Scholar
  7. Bahman Bahmani, Ashish Goel, and Kamesh Munagala. Efficient primal-dual graph algorithms for mapreduce. In International Workshop on Algorithms and Models for the Web-Graph, pages 59-78. Springer, 2014. Google Scholar
  8. Alkida Balliu, Sebastian Brandt, and Dennis Olivetti. Distributed lower bounds for ruling sets. SIAM Journal on Computing, 51(1):70-115, 2022. Google Scholar
  9. Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. Journal of the ACM (JACM), 63(3):1-45, 2016. Google Scholar
  10. József Beck. An algorithmic approach to the lovász local lemma. i. Random Structures & Algorithms, 2(4):343-365, 1991. Google Scholar
  11. Avraham Ben-Aroya, Klim Efremenko, and Amnon Ta-Shma. Local list-decoding with a constant number of queries. Technical Report TR10-047, Electronic Colloquium on Computational Complexity, April 2010. Google Scholar
  12. Suman K Bera, Noujan Pashanasangi, and C Seshadhri. Linear time subgraph counting, graph degeneracy, and the chasm at size six. arXiv preprint arXiv:1911.05896, 2019. Google Scholar
  13. Edvin Berglin and Gerth Stølting Brodal. A simple greedy algorithm for dynamic graph orientation. Algorithmica, 82(2):245-259, 2020. Google Scholar
  14. Aaron Bernstein and Cliff Stein. Faster fully dynamic matchings with small approximation ratios. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 692-711. SIAM, 2016. Google Scholar
  15. Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. Lower bounds for local monotonicity reconstruction from transitive-closure spanners. SIAM J. Discrete Math., 26(2):618-646, 2012. Google Scholar
  16. Amartya Shankha Biswas, Talya Eden, Quanquan C Liu, Ronitt Rubinfeld, and Slobodan Mitrović. Massively parallel algorithms for small subgraph counting. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  17. Amartya Shankha Biswas, Edward Pyne, and Ronitt Rubinfeld. Local access to random walks, january 2022. Innovations in Theoretical Computer Science (ITCS 2022), 2022. Google Scholar
  18. Amartya Shankha Biswas, Ronitt Rubinfeld, and Anak Yodpinyanee. Local access to huge random objects through partial sampling. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Google Scholar
  19. Markus Blumenstock and Frank Fischer. A constructive arboricity approximation scheme. In International Conference on Current Trends in Theory and Practice of Informatics, pages 51-63. Springer, 2020. Google Scholar
  20. Greg Bodwin and Sebastian Krinninger. Fully dynamic spanners with worst-case update time. arXiv preprint arXiv:1606.07864, 2016. Google Scholar
  21. Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto. A lower bound for the distributed lovász local lemma. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 479-488, 2016. Google Scholar
  22. Sebastian Brandt, Christoph Grunau, and Václav Rozhoň. The randomized local computation complexity of the lovász local lemma. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 307-317, 2021. Google Scholar
  23. Gerth Stølting Brodal and Rolf Fagerberg. Dynamic representations of sparse graphs. In Algorithms and Data Structures: 6th International Workshop, WADS’99 Vancouver, Canada, August 11-14, 1999 Proceedings 6, pages 342-351. Springer, 1999. Google Scholar
  24. Andrea Campagna, Alan Guo, and Ronitt Rubinfeld. Local reconstructors and tolerant testers for connectivity and diameter. In APPROX-RANDOM, pages 411-424, 2013. URL: https://doi.org/10.1007/978-3-642-40328-6_29.
  25. Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, and Yufan Zheng. The complexity of (δ+ 1) coloring in congested clique, massively parallel computation, and centralized local computation. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 471-480, 2019. Google Scholar
  26. Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, and Jara Uitto. Distributed edge coloring and a special case of the constructive lovász local lemma. ACM Transactions on Algorithms (TALG), 16(1):1-51, 2019. Google Scholar
  27. Moses Charikar. Greedy approximation algorithms for finding dense components in a graph. In International workshop on approximation algorithms for combinatorial optimization, pages 84-95. Springer, 2000. Google Scholar
  28. Aleksander BG Christiansen, Jacob Holm, Eva Rotenberg, and Carsten Thomassen. On dynamic α+ 1 arboricity decomposition and out-orientation. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  29. Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32-53, 1986. Google Scholar
  30. Andrzej Dorobisz and Jakub Kozik. Local computation algorithms for coloring of uniform hypergraphs. arXiv preprint arXiv:2103.10990, 2021. Google Scholar
  31. A. Dutta, R. Levi, D. Ron, and R. Rubinfeld. A simple online competitive adaptation of lempel-ziv compression with efficient random access support. In Proceedings of the Data Compression Conference (DCC), pages 113-122, 2013. Google Scholar
  32. Guy Even, Reut Levi, Moti Medina, and Adi Rosén. Sublinear random access generators for preferential attachment graphs. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, pages 6:1-6:15, 2017. Google Scholar
  33. Guy Even, Moti Medina, and Dana Ron. Deterministic stateless centralized local algorithms for bounded degree graphs. In Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings 21, pages 394-405. Springer, 2014. Google Scholar
  34. D. Beaver J. Feigenbaum. Hiding instances in multi-oracle queries. In Proc. 7th Annual STACS conference, pages 34-48, 1990. Google Scholar
  35. J. Feigenbaum and L. Fortnow. Random self-reducibility of complete sets. SIAM Journal on Computing, 22:994-1005, 1993. Google Scholar
  36. P. Ferragina and R. Venturini. A simple storage scheme for strings achieving entropy bounds. In ACM-SIAM Symposium on Discrete Algorithms, pages 690-696, 2007. URL: https://doi.org/10.1145/1283383.1283457.
  37. Manuela Fischer and Mohsen Ghaffari. Sublogarithmic distributed algorithms for lov$$1'asz local lemma, and the complexity hierarchy. arXiv preprint arXiv:1705.04840, 2017. Google Scholar
  38. Manuela Fischer, Mohsen Ghaffari, and Fabian Kuhn. Deterministic distributed edge-coloring via hypergraph maximal matching. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 180-191. IEEE, 2017. Google Scholar
  39. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximate functions. In Proc. 23rd Annual ACM Symposium on the Theory of Computing, pages 32-42, 1991. Google Scholar
  40. Mohsen Ghaffari. An improved distributed algorithm for maximal independent set. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 270-277. SIAM, 2016. Google Scholar
  41. Mohsen Ghaffari. Local computation of maximal independent set. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 438-449. IEEE, 2022. Google Scholar
  42. Mohsen Ghaffari, David G Harris, and Fabian Kuhn. On derandomizing local distributed algorithms. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 662-673. IEEE, 2018. Google Scholar
  43. Mohsen Ghaffari, Silvio Lattanzi, and Slobodan Mitrović. Improved parallel algorithms for density-based network clustering. In International Conference on Machine Learning, pages 2201-2210. PMLR, 2019. Google Scholar
  44. Mohsen Ghaffari and Hsin-Hao Su. Distributed degree splitting, edge coloring, and orientations. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2505-2523. SIAM, 2017. Google Scholar
  45. Mohsen Ghaffari and Jara Uitto. Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1636-1653. SIAM, 2019. Google Scholar
  46. Oded Goldreich, Ronitt Rubinfeld, and Madhu Sudan. Learning polynomials with queries: the highly noisy case. SIAM Journal on Discrete Mathematics, 13(4):535-570, 2000. Google Scholar
  47. R. González and G. Navarro. Statistical encoding of succint data structures. In Proceedings of CPM, pages 295-306, 2006. Google Scholar
  48. Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, and Jukka Suomela. Non-local probes do not help with graph problems. arXiv preprint arXiv:1512.05411, 2015. Google Scholar
  49. Parikshit Gopalan, Adam R. Klivans, and David Zuckerman. List-decoding Reed Muller codes over small fields. In Proc. 40th Annual ACM Symposium on Theory of Computing, pages 265-274, 2008. Google Scholar
  50. Christoph Grunau, Slobodan Mitrović, Ronitt Rubinfeld, and Ali Vakilian. Improved local computation algorithm for set cover via sparsification. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2993-3011. SIAM, 2020. Google Scholar
  51. Christoph Grunau, Václav Rozhoň, and Sebastian Brandt. The landscape of distributed complexities on trees and beyond. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pages 37-47, 2022. Google Scholar
  52. David G Harris. Distributed local approximation algorithms for maximum matching in graphs and hypergraphs. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 700-724. IEEE, 2019. Google Scholar
  53. David G Harris, Hsin-Hao Su, and Hoa T Vu. On the locality of nash-williams forest decomposition and star-forest decomposition. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 295-305, 2021. Google Scholar
  54. Avinatan Hassidim, Jonathan A Kelner, Huy N Nguyen, and Krzysztof Onak. Local graph partitions for approximation and testing. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 22-31. IEEE, 2009. Google Scholar
  55. Avinatan Hassidim, Yishay Mansour, and Shai Vardi. Local computation mechanism design. ACM Trans. Economics and Comput., 4(4):21:1-21:24, 2016. Google Scholar
  56. Meng He, Ganggui Tang, and Norbert Zeh. Orienting dynamic graphs, with applications to maximal matchings and adjacency queries. In Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 128-140. Springer, 2014. Google Scholar
  57. Dan Hefetz, Fabian Kuhn, Yannic Maus, and Angelika Steger. Polynomial lower bound for distributed graph coloring in a weak local model. In Distributed Computing: 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, pages 99-113. Springer, 2016. Google Scholar
  58. Russell Impagliazzo and Avi Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proc. 29th Annual ACM Symposium on the Theory of Computing, pages 220-229, 1997. Google Scholar
  59. Madhav Jha and Sofya Raskhodnikova. Testing and reconstruction of lipschitz functions with applications to data privacy. SIAM J. Comput., 42(2):700-731, 2013. URL: https://doi.org/10.1137/110840741.
  60. Satyen Kale, Yuval Peres, and C. Seshadhri. Noise tolerance of expanders and sublinear expansion reconstruction. SIAM J. Comput., 42(1):305-323, 2013. URL: https://doi.org/10.1137/110837863.
  61. Michael Kapralov, Slobodan Mitrovic, Ashkan Norouzi-Fard, and Jakab Tardos. Space efficient approximation to maximum matching size from uniform edge samples. CoRR, abs/1907.05725, 2019. Google Scholar
  62. Michael Kapralov, Slobodan Mitrović, Ashkan Norouzi-Fard, and Jakab Tardos. Space efficient approximation to maximum matching size from uniform edge samples. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1753-1772. SIAM, 2020. Google Scholar
  63. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. 32nd Annual ACM Symposium on the Theory of Computing, pages 80-86, 2000. Google Scholar
  64. Swastik Kopparty and Shubhangi Saraf. Local list-decoding and testing of sparse random linear codes from high-error. Technical Report 115, Electronic Colloquium on Computational Complexity (ECCC), 2009. Google Scholar
  65. Akash Kumar, C Seshadhri, and Andrew Stolman. Random walks and forbidden minors III: poly (d ε^-1)-time partition oracles for minor-free graph classes. In Electron. Colloquium Comput. Complex., volume 28, page 8, 2021. Google Scholar
  66. Jane Lange, Ronitt Rubinfeld, and Arsen Vasilyan. Properly learning monotone functions via local reconstruction. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2022. Google Scholar
  67. Reut Levi and Dana Ron. A quasi-polynomial time partition oracle for graphs with an excluded minor. ACM Transactions on Algorithms (TALG), 11(3):1-13, 2015. Google Scholar
  68. Reut Levi, Ronitt Rubinfeld, and Anak Yodpinyanee. Local computation algorithms for graphs of non-constant degrees. In Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, pages 59-61, 2015. Google Scholar
  69. Reut Levi, Ronitt Rubinfeld, and Anak Yodpinyanee. Local computation algorithms for graphs of non-constant degrees. Algorithmica, 77(4):971-994, 2017. Google Scholar
  70. R. Lipton. New directions in testing. In Proc. DIMACS Workshop on Distributed Computing and Cryptography, 1989. Google Scholar
  71. Y. Mansour, A. Rubinstein, Shai Vardi, and Ning Xie. Converting online algorithms to local computation algorithms. In Unpublished manuscript, 2011. Google Scholar
  72. Yishay Mansour and Shai Vardi. A local computation approximation scheme to maximum matching. In APPROX-RANDOM, pages 260-273, 2013. Google Scholar
  73. Michael Molloy and Bruce Reed. Further algorithmic aspects of the local lemma. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 524-529, 1998. Google Scholar
  74. S. Muthukrishnan, M. Strauss, and X. Zheng. Workload-optimal histograms on streams. Technical Report 2005-19, DIMACS Technical Report, 2005. Google Scholar
  75. Ofer Neiman and Shay Solomon. Simple deterministic algorithms for fully dynamic maximal matching. ACM Trans. Algorithms, 12(1), November 2015. Google Scholar
  76. H. N. Nguyen and K. Onak. Constant-time approximation algorithms via local improvements. In Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pages 327-336, 2008. Google Scholar
  77. Michal Parnas and Dana Ron. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theoretical Computer Science, 381(1-3):183-196, 2007. Google Scholar
  78. Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee. Local computation algorithms for spanners. In ITCS, volume 124, pages 58:1-58:21, 2019. Google Scholar
  79. Jean-Claude Picard and Maurice Queyranne. A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory. Networks, 12(2):141-159, 1982. Google Scholar
  80. Will Rosenbaum and Jukka Suomela. Seeing far vs. seeing wide: Volume complexity of local graph problems. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 89-98, 2020. Google Scholar
  81. Ronitt Rubinfeld, Gil Tamir, Shai Vardi, and Ning Xie. Fast local computation algorithms. arXiv preprint arXiv:1104.1377, 2011. Google Scholar
  82. K. Sadakane and R. Grossi. Squeezing succinct data structures into entropy bounds. In ACM-SIAM Symposium on Discrete Algorithms, pages 1230-1239, 2006. Google Scholar
  83. M. E. Saks and C. Seshadhri. Local monotonicity reconstruction. SIAM Journal on Computing, 39(7):2897-2926, 2010. Google Scholar
  84. Shay Solomon and Nicole Wein. Improved dynamic graph coloring. ACM Transactions on Algorithms (TALG), 16(3):1-24, 2020. Google Scholar
  85. Hsin-Hao Su and Hoa T Vu. Distributed dense subgraph detection and low outdegree orientation. In 34th International Symposium on Distributed Computing, 2020. Google Scholar
  86. Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2):236-266, 2001. Google Scholar
  87. Herbert Hans Westermann. Efficient algorithms for matroid sums. University of Colorado at Boulder, 1988. Google Scholar
  88. Sergey Yekhanin. Private information retrieval. Commun. ACM, 53(4):68-73, 2010. Google Scholar
  89. Y. Yoshida, Y. Yamamoto, and H. Ito. An improved constant-time approximation algorithm for maximum matchings. In Proc. 41st Annual ACM Symposium on the Theory of Computing, pages 225-234, 2009. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact