Sciweavers

107 search results - page 9 / 22
» Eigenvalues of the derangement graph
Sort
View
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 8 days ago
Derandomized Squaring of Graphs
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...
Eyal Rozenman, Salil P. Vadhan
LATIN
1998
Springer
13 years 11 months ago
Spectral Techniques in Graph Algorithms
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...
Noga Alon
CSC
2008
13 years 8 months ago
Eigenvalue Spectra Measurements of Complex Networks
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...
Kenneth A. Hawick
CIS
2010
Springer
13 years 1 months ago
Sensor Graphs for Guaranteed Cooperative Localization Performance
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
Y. Yuan, H. G. Tanner
CVIU
2008
113views more  CVIU 2008»
13 years 6 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...