193 search results - page 15 / 39 » The structure of almost all graphs in a hereditary property |
RSA
2010
13 years 6 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 ...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
JMLR
2010
13 years 6 months ago
2010
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...