718 search results - page 127 / 144 » Coloring quasi-line graphs |
100
Voted
CCS
2008
ACM
14 years 11 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
TC
1998
14 years 9 months ago
1998
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
JCT
2010
14 years 8 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
TIT
2011
14 years 4 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...