Finding paths in sparse random graphs requires many queries
- 29 September 2016
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 50 (1) , 71-85
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Proofs from THE BOOK2014
- Anatomy of the giant component: The strictly supercritical regimeEuropean Journal of Combinatorics, 2014
- Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson treesThe Annals of Probability, 2013
- The phase transition in random graphs: A simple proofRandom Structures & Algorithms, 2012
- Routing complexity of faulty networksRandom Structures & Algorithms, 2007
- Random Graphs2001
- On tree census and the giant component in sparse random graphsRandom Structures & Algorithms, 1990
- Une théorie combinatoire des séries formellesAdvances in Mathematics, 1981
- The longest path in a random graphCombinatorica, 1981
- The Galton-Watson process conditioned on the total progenyJournal of Applied Probability, 1975