Distributed Maximal Matching and Maximal Independent Set on Hypergraphs

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022

3 November 2022

Dennis Olivetti

ArXiv (abs)PDF HTML

Papers citing "Distributed Maximal Matching and Maximal Independent Set on Hypergraphs"

5 / 5 papers shown

Title
Resource Constrained Pathfinding with A* and Negative WeightsEmbedded Systems and Applications (ESA), 2025 Saman Ahmadi Andrea Raith Mahdi Jalili 121 1 0 14 Mar 2025
Distributed weak independent sets in hypergraphs: Upper and lower bounds Duncan Adamson Will Rosenbaum Paul G. Spirakis 268 1 0 20 Nov 2024
Distributed Quantum Advantage for Local ProblemsSymposium on the Theory of Computing (STOC), 2024 Alkida Balliu S. Brandt Xavier Coiteux-Roy Francesco d’Amore Massimo Equi ... Dennis Olivetti M. Renou Jukka Suomela Lucas Tendick Isadora Veeren 86 10 0 05 Nov 2024
Tight Lower Bounds in the Supported LOCAL Model Alkida Balliu Thomas Boudier Sebastian Brandt Dennis Olivetti 105 3 0 01 May 2024
The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 Yi-Jun Chang Zeyong Li 127 6 0 02 May 2023