SOLUTION: What is the cover time of a complete graph on n vertices (i.e., a graph on n vertices with edges between every pair of vertices)?
a) Θ(n)
b) Θ(nlogn)
c) \
Algebra ->
Probability-and-statistics
-> SOLUTION: What is the cover time of a complete graph on n vertices (i.e., a graph on n vertices with edges between every pair of vertices)?
a) Θ(n)
b) Θ(nlogn)
c) \
Log On
