Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs

DOI10.1137/19M1279241zbMath1445.05098arXiv1807.07645MaRDI QIDQ5115699

David G. Harris

Publication date: 18 August 2020

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.07645

zbMATH Keywords

hypergraph; matching; edge coloring; derandomization; LOCAL; Nash-Williams decomposition

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C65: Hypergraphs

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms