46 search results - page 1 / 10 » On k-partitioning of Hamming Graphs |
65
Voted
COCOON
1999
Springer
15 years 2 months ago
1999
Springer
79
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
68
Voted
RSA
2010
14 years 8 months ago
2010
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
DAM
1999
14 years 10 months ago
1999
97
Voted
SIAMJO
2010
14 years 5 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...