Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs
- 17 April 2018
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 38 (3) , 619-664
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Invariant Gaussian processes and independent sets on regular graphs of large girthRandom Structures & Algorithms, 2014
- Limits of local algorithms over sparse random graphs2014
- Large independent sets in random regular graphsTheoretical Computer Science, 2009
- Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth CorrectionsCombinatorics, Probability and Computing, 2009
- Packing vertices and edges in random regular graphsRandom Structures & Algorithms, 2007
- On the Independent Domination Number of Random Regular GraphsCombinatorics, Probability and Computing, 2006
- Randomized greedy algorithms for finding smallk-dominating sets of regular graphsRandom Structures & Algorithms, 2005
- Large 2-Independent Sets of Regular GraphsElectronic Notes in Theoretical Computer Science, 2003
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959