1732 search results - page 15 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
JCST
2008
14 years 9 months ago
2008
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
120
click to vote
SCALESPACE
2007
Springer
15 years 3 months ago
2007
Springer
Level set methods have been proven to be efficient tools for tracing interface problems. Recently, some variants of the Osher- Sethian level set methods, which are called the Piece...
70
Voted
JCT
2008
14 years 9 months ago
2008
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...
COMBINATORICS
2007
14 years 9 months ago
2007
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...