316 search results - page 12 / 64 » On almost self-complementary graphs |
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
CAAN
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
WAW
2009
Springer
14 years 3 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
ESA
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...