2095 search results - page 198 / 419 » Improved pebbling bounds |
149
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if α ≥ 0.35312, th...
126
click to vote
IPL
2006
15 years 6 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
155
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
133
click to vote
JCO
2007
15 years 6 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
154
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...