46 search results - page 4 / 10 » On k-partitioning of Hamming Graphs |
AAECC
2007
Springer
14 years 2 months ago
2007
Springer
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On ) the set of vectors with even (respectively, odd)...
MP
2010
13 years 7 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
PC
2008
13 years 8 months ago
2008
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we propose a novel 3D shape based met...
CPC
2007
13 years 8 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...