Finding perfect matchings in bipartite hypergraphs
From MaRDI portal
Publication:2416439
DOI10.1007/s00493-017-3567-2zbMath1438.05180arXiv1509.07007OpenAlexW2773183959MaRDI QIDQ2416439
Publication date: 23 May 2019
Published in: Combinatorica, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07007
hypergraphbipartite graphmatchingsperfect matchinglocal search algorithmsHall's conditionHaxell's conditionbipartite hypergraphs
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On the differential equation of first and second order in the Zeon algebra, Perfect matching in bipartite hypergraphs subject to a demand graph, Relating hypergraph parameters of generalized power graphs, Finding independent transversals efficiently