The cover time of random geometric graphs

MaRDI QIDQ4633810zbMATH OpenFDO

Authors Colin Cooper, Alan Frieze

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496776

Mathematics Subject Classification ID

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

Recommendations

• The cover time of random geometric graphs
• Automata, Languages and Programming
• On the cover time and mixing time of random geometric graphs
• The Cover Time of Random Regular Graphs
• scientific article; zbMATH DE number 2079333

Cited in

(8)

• Commute times of random walks on trees
• On the cover time and mixing time of random geometric graphs
• Constrained minimum passage time in random geometric graphs
• The bin-covering technique for thresholding random geometric graph properties
• The cover time of random geometric graphs
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• On the mixing time of geographical threshold graphs
• Automata, Languages and Programming

This page was built for publication: The cover time of random geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633810)