Sciweavers

332 search results - page 2 / 67
» Complexity analysis of a decentralised graph colouring algor...
Sort
View
CSR
2008
Springer
13 years 6 months ago
Colouring, constraint satisfaction, and complexity
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...
Pavol Hell, Jaroslav Nesetril
CPC
2007
101views more  CPC 2007»
13 years 6 months ago
Colouring Random 4-Regular Graphs
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 ...
Lingsheng Shi, Nicholas C. Wormald
DICTA
2003
13 years 7 months ago
Separating a Colour Texture from an Arbitrary Background
Partially supervised segmentation, that is, segmentation with always incomplete training data has many practical applications in image analysis and retrieval. This paper proposes a...
Linjiang Yu, Georgy L. Gimel'farb
ICAC
2005
IEEE
13 years 11 months ago
Decentralised Autonomic Computing: Analysing Self-Organising Emergent Behaviour using Advanced Numerical Methods
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...
Tom De Wolf, Giovanni Samaey, Tom Holvoet, Dirk Ro...
CPC
2007
95views more  CPC 2007»
13 years 6 months ago
Colouring Random Regular Graphs
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...
Lingsheng Shi, Nicholas C. Wormald