1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2025★ 1 cited
Constant time enumeration of perfect bipartite matchings
Jiří Fink
We present an algorithm that enumerates all the perfect matchings in a given bipartite graph G = (V,E). Our algorithm requires a constant amortized time to visit one perfect matchi…
math.CO2025
Matchings in Hypercubes Extend to Long Cycles
Jiří Fink, Vojtěch Hotmar
The -dimensional hypercube graph has as vertices all subsets of , and an edge between any two sets that differ in a single element. The Ruskey-Savage con…