3204 search results - page 396 / 641 » The b-chromatic Number of a Graph |
151
click to vote
SIGECOM
2006
ACM
16 years 21 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
166
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
184
click to vote
PC
2010
15 years 5 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...
194
click to vote
SOSYM
2010
15 years 5 months ago
2010
In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, to...
197
click to vote
SSDBM
2010
IEEE
15 years 5 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...