Pages that link to "Item:Q2416439"
From MaRDI portal
The following pages link to Finding perfect matchings in bipartite hypergraphs (Q2416439):
Displaying 12 items.
- Perfect matchings and extended polymatroid (Q946789) (← links)
- Perfect matchings in balanced hypergraphs---a combinatorial approach (Q1872893) (← links)
- Relating hypergraph parameters of generalized power graphs (Q2056895) (← links)
- Finding perfect matchings in bipartite hypergraphs (Q2416439) (← links)
- On the differential equation of first and second order in the Zeon algebra (Q2661146) (← links)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- An algorithmic framework for the matching problem in some hypergraphs (Q3789371) (← links)
- (Q4575710) (redirect page) (← links)
- Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (Q4608650) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- Finding strongly popular \(b\)-matchings in bipartite graphs (Q5915825) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)