Speeding Up Cover Time of Sparse Graphs Using Local Knowledge

DOI10.1007/978-3-319-29516-9_1zbMath1411.05237OpenAlexW2340375478MaRDI QIDQ2798211

Moez Draief, Colin Cooper, Mohammed Amin Abdullah

Publication date: 4 April 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29516-9_1

zbMATH Keywords

random walksrandom graphsnetwork exploration

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)

Related Items (3)

Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time ⋮ Reversible random walks on dynamic graphs ⋮ The cover time of deterministic random walks for general transition probabilities

This page was built for publication: Speeding Up Cover Time of Sparse Graphs Using Local Knowledge