Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs
We introduce a general class of algorithms and analyse their application to regular graphs of large girth. In particular, we can transfer several results proved for random regular graphs into (deterministic) results about all regular graphs with sufficiently large girth. This reverses the usual direction, which is from the deterministic setting to the random one. In particular, this approach enables, for the first time, the achievement of results equivalent to those obtained on random regular graphs by a powerful class of algorithms which contain prioritised actions. As a result, we obtain new upper or lower bounds on the size of maximum independent sets, minimum dominating sets, maximum k-independent sets, minimum k-dominating sets and maximum k-separated matchings in r-regular graphs with large girth.
Mathematics Subject Classification (2000)05C35 05C80 05C69 05C85
Unable to display preview. Download preview PDF.
- C. Hoppen and N. Wormald: Local algorithms, regular graphs of large girth, and random regular graphs, http://arxiv.org/abs/1308.0266v2.
- M. Rahman and B. Virág: Local algorithms for independent sets are half-optimal, to appear in Annals of Probability, http://arxiv.org/abs/1402.0485.
- N. C. Wormald: The differential equation method for random graph processes and greedy algorithms, in: Lectures on Approximation and Randomized Algorithms, M. Karoński and H.J. Prömel (eds), 73–155, PWN, Warsaw, 1999.Google Scholar
- N.C. Wormald: Random graphs and asymptotics, Section 8.2 in Handbook of Graph Theory (J. L. Gross and J. Yellen eds), 817–836, CRC, Boca Raton, 2004.Google Scholar