215 search results - page 10 / 43 » On the number of factorizations of a full cycle |
SIAMSC
2008
13 years 8 months ago
2008
The convergence of Multigrid methods can be analyzed based on a Fourier analysis of the method or by proving certain inequalities that have to be fulfilled by the smoother and by t...
DAM
2007
13 years 8 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
SIGCOMM
1996
ACM
14 years 20 days ago
1996
ACM
This paper describes several techniques designed to improve protocol latency, and reports on their effectiveness when measured on a modern RISC machine employing the DEC Alpha pro...
JCT
2010
13 years 7 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
DDECS
2007
IEEE
14 years 13 days ago
2007
IEEE
A method of generating test pairs for the delay faults is presented in this paper. The modification of the MISR register gives the source of test pairs. The modification of this r...