The Complexity of Perfect Matching Problems on Dense Hypergraphs

DOI10.1007/978-3-642-10631-6_64zbMath1273.68180WikidataQ57255182 ScholiaQ57255182MaRDI QIDQ3652249

Edyta Szymańska, Andrzej Ruciński, Marek Karpinski

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_64

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

A geometric theory for hypergraph matching, Approximating vertex cover in dense hypergraphs, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree