1. Asymptotic enumeration of strongly connected digraphs by vertices and edges1. Issue 1 (26th April 2012) Authors: Pérez‐Giménez, Xavier; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 43:Issue 1(2013) Page Start: 80 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Counting strongly‐connected, moderately sparse directed graphs. Issue 1 (6th June 2012) Authors: Pittel, Boris Journal: Random structures & algorithms Issue: Volume 43:Issue 1(2013) Page Start: 49 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Longest cycles in sparse random digraphs12. Issue 1 (28th May 2012) Authors: Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 43:Issue 1(2013) Page Start: 1 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Random geometric subdivisions. Issue 1 (1st August 2012) Authors: Volkov, Stanislav Journal: Random structures & algorithms Issue: Volume 43:Issue 1(2013) Page Start: 115 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Topology discovery of sparse random graphs with few participants12. Issue 1 (27th April 2012) Authors: Anandkumar, Animashree; Hassidim, Avinatan; Kelner, Jonathan Journal: Random structures & algorithms Issue: Volume 43:Issue 1(2013) Page Start: 16 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗