19 search results - page 3 / 4 » cpc 2004 |
CPC
2004
13 years 4 months ago
2004
CPC
2004
13 years 4 months ago
2004
Using representation theory, we obtain a necessary and sufficient condition for a discrete
CPC
2004
13 years 4 months ago
2004
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
CPC
2004
13 years 4 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
CPC
2004
13 years 4 months ago
2004
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...