"An upper bound on the cover time for powers of graphs."

Johan Jonasson (2000)

Details and statistics

DOI: 10.1016/S0012-365X(00)00013-3

access: open

type: Journal Article

metadata version: 2021-02-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics