112 search results - page 7 / 23 » An edge colouring of multigraphs |
CPC
2010
13 years 7 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
DM
2010
13 years 10 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
SIROCCO
2007
13 years 11 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
DAGM
2004
Springer
14 years 3 months ago
2004
Springer
Compressed domain image retrieval allows image indexing to be performed directly on the compressed data without the need of decoding. This approach hence provides a significant ga...
CISST
2004
13 years 11 months ago
2004
Abstract Compressed domain image retrieval is going to play an increasingly important role in the future. It allows the calculation of image features and hence content-based image ...