2270 search results - page 13 / 454 » On the distribution of eigenvalues of graphs |
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
104
Voted
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
LATIN
1998
Springer
15 years 1 months ago
1998
Springer
The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we de...
PVM
1998
Springer
15 years 1 months ago
1998
Springer
The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:
CSC
2008
14 years 11 months ago
2008
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...