Distributed Maximal Matching and Maximal Independent Set on Hypergraphs

Alkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti. Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 2632-2676, SIAM, 2023. [doi]

@inproceedings{Balliu0KO23,
  title = {Distributed Maximal Matching and Maximal Independent Set on Hypergraphs},
  author = {Alkida Balliu and Sebastian Brandt 0002 and Fabian Kuhn and Dennis Olivetti},
  year = {2023},
  doi = {10.1137/1.9781611977554.ch100},
  url = {https://doi.org/10.1137/1.9781611977554.ch100},
  researchr = {https://researchr.org/publication/Balliu0KO23},
  cites = {0},
  citedby = {0},
  pages = {2632-2676},
  booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023},
  editor = {Nikhil Bansal 0001 and Viswanath Nagarajan},
  publisher = {SIAM},
  isbn = {978-1-61197-755-4},
}