11 search results - page 2 / 3 » Optimal strong parity edge-coloring of complete graphs |
TCAD
2008
13 years 4 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
SIROCCO
2000
13 years 6 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
ICCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...