The Cover Time of Random Digraphs
From MaRDI portal
Publication:3603483
DOI10.1007/978-3-540-74208-1_31zbMATH Open1171.05417OpenAlexW1480070879MaRDI QIDQ3603483FDOQ3603483
Authors: Colin Cooper, Alan Frieze
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_31
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)
Cited In (7)
- Stationary distribution and cover time of random walks on random digraphs
- Random walks on some basic classes of digraphs
- Title not available (Why is that?)
- On the cover time and mixing time of random geometric graphs
- The cover time of random geometric graphs
- The Cover Time of Cartesian Product Graphs
- The stochastic weighted complexity of a group covering of a digraph
This page was built for publication: The Cover Time of Random Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603483)