1 paper
Robert A. Krueger, David Staudinger
A randomly perturbed digraph is an n-vertex directed graph with all out- and in-degrees linear in n, to which a linear number (depending on the degree) of random edges have bee…