332 search results - page 2 / 67 » Complexity analysis of a decentralised graph colouring algor... |
CSR
2008
Springer
13 years 6 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
CPC
2007
13 years 6 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
DICTA
2003
13 years 7 months ago
2003
Partially supervised segmentation, that is, segmentation with always incomplete training data has many practical applications in image analysis and retrieval. This paper proposes a...
ICAC
2005
IEEE
13 years 11 months ago
2005
IEEE
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...
CPC
2007
13 years 6 months ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...