3757 search results - page 163 / 752 » The overlap number of a graph |
189
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
180
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
175
click to vote
DAM
2007
15 years 6 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
130
click to vote
JCO
2007
15 years 6 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
144
click to vote
JCT
2008
15 years 6 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...