157 search results - page 23 / 32 » Frugal Colouring of Graphs |
142
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/co...
148
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
136
click to vote
FUIN
2007
15 years 4 months ago
2007
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
150
click to vote
DAM
1999
15 years 4 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
129
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...