462 search results - page 93 / 93 » Covering a Tree by a Forest |
RSA
2010
13 years 3 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
SODA
2010
ACM
13 years 3 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...