5 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DM2012
Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs
Martin Dietzfelbinger, Michael Rink
Consider a random bipartite multigraph with left nodes and right nodes. Each left node has random right neighbors. The average left degre…
cs.DS2012★ 5 cited
On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
Michael Rink
We study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges bu…
cs.DS2012★ 1 cited
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
Martin Dietzfelbinger, Hendrik Peilke, Michael Rink
We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random gra…