3757 search results - page 68 / 752 » The overlap number of a graph |
JCT
2006
14 years 9 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
CIE
2007
Springer
15 years 4 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
154
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
ECCC
2000
14 years 9 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...