2304 search results - page 155 / 461 » On the Vulnerability of Large Graphs |
157
click to vote
DMTCS
2006
15 years 6 months ago
2006
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
146
click to vote
FFA
2006
15 years 6 months ago
2006
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
171
click to vote
CPC
2007
15 years 6 months ago
2007
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
165
click to vote
ENTCS
2007
15 years 6 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
163
click to vote
JUCS
2007
15 years 6 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...