36781 search results - page 65 / 7357 » Parameterizing by the Number of Numbers |
125
click to vote
ENDM
2000
14 years 9 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
DM
2002
14 years 9 months ago
2002
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
RSA
2000
14 years 9 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
BC
1998
14 years 9 months ago
1998
The traditional paradigm for studying the magical number is questioned and a new approach is sought in order to obtain a better conceptual understanding of this phenomenon. Buildin...
MOC
1998
14 years 9 months ago
1998
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...