100 search results - page 1 / 20 » A distance-labelling problem for hypercubes |
ENDM
2007
13 years 10 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
NETWORKS
2002
13 years 10 months ago
2002
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...
SIAMDM
2010
13 years 9 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
IPL
2002
13 years 10 months ago
2002
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
ICPP
1995
IEEE
14 years 2 months ago
1995
IEEE
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...