5 search results - page 1 / 1 » Time Optimal d-List Colouring of a Graph |
CSR
2010
Springer
13 years 9 months ago
2010
Springer
AAIM
2007
Springer
13 years 10 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
JCT
2010
13 years 2 months ago
2010
We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any v...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
IPPS
2007
IEEE
13 years 10 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...