36 search results - page 8 / 8 » Computational Complexity of Weighted Threshold Games |
STOC
2010
ACM
13 years 9 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...