157 search results - page 25 / 32 » Frugal Colouring of Graphs |
PC
2010
13 years 7 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
BMVC
2010
13 years 7 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
DM
2008
13 years 9 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
DM
2008
13 years 9 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...