7840 search results - page 572 / 1568 » On generalized Ramsey numbers |
182
click to vote
DAM
2008
15 years 7 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
176
click to vote
ECR
2010
15 years 7 months ago
2010
Abstract To date, trust and reputation systems have often been evaluated using methods of their designers' own devising. Recently, we demonstrated that a number of noteworthy ...
198
Voted
EJC
2010
15 years 7 months ago
2010
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
204
Voted
DEBU
2008
15 years 7 months ago
2008
The Pathfinder project makes inventive use of relational database technology--originally developed to process data of strictly tabular shape--to construct efficient database-suppo...
191
Voted
DM
2008
15 years 7 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...