753 search results - page 19 / 151 » Completing a (k - 1)-Assignment |
JCT
2007
14 years 11 months ago
2007
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , ...
JCT
2007
14 years 11 months ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
DAM
2008
14 years 12 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...