278 search results - page 21 / 56 » Two Upper Bounds on the Chromatic Number |
JGAA
2008
13 years 8 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
JSAC
2006
13 years 8 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
VTC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we focus on the diversity order of the decode-and-forward (DF) cooperative networks with relay selection. Many detection schemes have been proposed for the DF; b...
JC
2007
13 years 8 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
COMBINATORICA
2007
13 years 8 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...