Abstract
Let P = G□H be the cartesian product of graphs G,H. We relate the cover time COV[P] of P to the cover times of its factors. When one of the factors is in some sense larger than the other, its cover time dominates, and can become of the same order as the cover time of the product as a whole. Our main theorem effectively gives conditions for when this holds. The probabilistic technique which we introduce, based on the blanket time, is more general and may be of independent interest, as might some of our lemmas. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Abdullah, M., Cooper, C., & Radzik, T. (2011). The cover time of Cartesian product graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6460 LNCS, pp. 377–389). https://doi.org/10.1007/978-3-642-19222-7_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
