3204 search results - page 164 / 641 » The b-chromatic Number of a Graph |
179
click to vote
GC
2011
Springer
14 years 9 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
176
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
167
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
168
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
169
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...