External Links

    Journal: Random Struct. Algorithms

    Volume 43, Issue 1

    1 -- 15Michael Krivelevich, Eyal Lubetzky, Benny Sudakov. Longest cycles in sparse random digraphs
    16 -- 48Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner. Topology discovery of sparse random graphs with few participants
    49 -- 79Boris Pittel. Counting strongly-connected, moderately sparse directed graphs
    80 -- 114Xavier Pérez-Giménez, Nicholas C. Wormald. Asymptotic enumeration of strongly connected digraphs by vertices and edges
    115 -- 130Stanislav Volkov. Random geometric subdivisions
    runs on