Abstract
In this paper we consider the computational complexity of deciding the existence of a perfect matching in certain classes of dense k-uniform hypergraphs. Some of these problems are known to be notoriously hard. There is also a renewed interest recently in the very special cases of them. One of the goals of this paper is to shed some light on the tractability barriers for those problems.
It has been known that the perfect matching problems are NP-complete for the classes of hypergraphs H with minimum ((k − 1) −wise) vertex degree δ at least c|V(H)| for \(c<\frac 1k\) and trivial for \(c\ge\frac 12,\) leaving the status of the problems with c in the interval \([\frac 1k,\frac 12)\) widely open. In this paper we show, somehow surprisingly, that \(\frac 12\), in fact, is not a threshold for the tractability of the perfect matching problem, and prove the existence of an ε> 0 such that the perfect matching problem for the class of hypergraphs H with δ at least \((\frac 12-\epsilon)|V(H)|\) is solvable in polynomial time. This seems to be the first polynomial time algorithm for the perfect matching problem on hypergraphs for which the existence problem is nontrivial. In addition, we consider parallel complexity of the problem, which could be also of independent interest in view of the known results for graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asadpour, A., Feige, U., Saberi, A.: Santa Claus Meets Hypergraph Matchings. In: Proc. of APPROX-RANDOM 2008, pp. 10–20 (2008)
Dalhaus, E., Hajnal, P., Karpiński, M.: On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs. J. Alg. 15, 367–384 (1993)
Edmonds, J.: Paths, trees and flowers. Canad J. Math. 17, 449–467 (1965)
Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, New York (1979)
Haxell, P.E.: A Condition for Matchability in Hypergraphs. Graphs and Combinatorics 11, 245–248 (1995)
Kühn, D., Osthus, D.: Critical chromatic number and the complexity of perfect packings in graphs. In: 17th ACM-SIAM Symposium on Discrete Algorithms 2006 (SODA), pp. 851–859 (2006)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)
Rödl, V., Ruciński, A., Szemerédi, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. JCT A 116(3), 613–636 (2009)
Rödl, V., Ruciński, A., Schacht, M., Szemerédi, E.: A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Commen. Math. Univ. Carol. 49(4), 633–636 (2008)
Szymańska, E.: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. In: Proc. of IWOCA (2009) (to appear)
Särkózy, G.: A fast parallel algorithm for finding Hamiltonian cycles in dense graphs. Discrete Mathematics 309, 1611–1622 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karpiński, M., Ruciński, A., Szymańska, E. (2009). The Complexity of Perfect Matching Problems on Dense Hypergraphs. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)