CORR
2004
Springer
13 years 7 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
The design of the defenses Internet systems can deploy against attack, especially adaptive and resilient defenses, must start from a realistic model of the threat. This requires an...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract -- The development of cost-effective highperformance parallel computing on multi-processor supercomputers makes it attractive to port excessively time consuming simulation...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Analyzing and controlling large distributed services under a wide range of conditions is difficult. Yet these capabilities are essential to a number of important development and o...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
