7796 search results - page 346 / 1560 » On Generalized Schur Numbers |
162
click to vote
DM
2008
15 years 7 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
174
click to vote
EJC
2008
15 years 7 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
207
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
128
click to vote
IJFCS
2006
15 years 6 months ago
2006
Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the ...
181
click to vote
TMC
2010
15 years 5 months ago
2010
—A key challenge in the design of real-time wireless multimedia systems is the presence of fading coupled with strict delay constraints. A very effective answer to this problem i...