scientific article; zbMATH DE number 7378657

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.45MaRDI QIDQ5009541

Tony Johansson

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1805.05780

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random walkcover timerandom regular graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Introduction to Random Graphs
• A proof of alon's second eigenvalue conjecture
• Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
• The Cover Time of Random Regular Graphs
• Greedy Random Walk
• Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk

This page was built for publication: