The Complexity of Perfect Matching Problems on Dense Hypergraphs

DOI10.1007/978-3-642-10631-6_64zbMath1273.68180OpenAlexW1603859152WikidataQ57255182 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

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

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

This page was built for publication: The Complexity of Perfect Matching Problems on Dense Hypergraphs