1749 search results - page 49 / 350 » Conditional colorings of graphs |
158
click to vote
RSA
2008
15 years 3 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
124
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Most existing transcriptional databases like Comprehensive Systems-Biology Database (CSB.DB) and Arabidopsis Microarray Database and Analysis Toolbox (GENEVESTIGATOR) ...
123
click to vote
CLEAR
2006
Springer
15 years 7 months ago
2006
Springer
We present an object detection and tracking algorithm that addresses the problem of multiple simultaneous targets tracking in realworld surveillance scenarios. The algorithm is bas...
122
Voted
NETWORKS
2002
15 years 3 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...