Perfect matchings in random graphs with prescribed minimal degree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Existence of a perfect matching in a random (1 +e-1)--out bipartite graph
Journal of Combinatorial Theory Series B
Karp-sipser on random graphs with a fixed degree sequence
Combinatorics, Probability and Computing
Random near-regular graphs and the node packing problem
Operations Research Letters
Hi-index | 0.01 |