Random Structures & Algorithms

Cover image for Vol. 43 Issue 1

August 2013

Volume 43, Issue 1

Pages 1–130

    1. Longest cycles in sparse random digraphs (pages 1–15)

      Michael Krivelevich, Eyal Lubetzky and Benny Sudakov

      Version of Record online: 28 MAY 2012 | DOI: 10.1002/rsa.20435

    2. Topology discovery of sparse random graphs with few participants (pages 16–48)

      Animashree Anandkumar, Avinatan Hassidim and Jonathan Kelner

      Version of Record online: 27 APR 2012 | DOI: 10.1002/rsa.20420

    3. Asymptotic enumeration of strongly connected digraphs by vertices and edges (pages 80–114)

      Xavier Pérez-Giménez and Nicholas Wormald

      Version of Record online: 26 APR 2012 | DOI: 10.1002/rsa.20416

    4. Random geometric subdivisions (pages 115–130)

      Stanislav Volkov

      Version of Record online: 1 AUG 2012 | DOI: 10.1002/rsa.20454

SEARCH

SEARCH BY CITATION