Constructive Bounds and Exact Expectations for the Random Assignment Problem
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Existence of a perfect matching in a random (1 +e-1)--out bipartite graph
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |