Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-Span'02
DOI: 10.1109/ispan.2002.1004285
|View full text |Cite
|
Sign up to set email alerts
|

Symmetric k-factorizations of hypercubes with factors of small diameter

Abstract: The links of the hypercube Q n can be partitioned into multiple link-disjoint spanning subnetworks, or factors. Each of these factors could simulate Q n . We therefore identify k-factorizations, or partitions of the links of Q n into factors of degree k, where 1) the factorization exists for all values of n such that n mod k = 0, 2) k is as small as possible, 3) the n/k factors have a similar structure, 4) the factors have as small a diameter as possible, and 5) the factors host Q n with as small a dilation as… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…We use the idea behind reduced and thin hypercubes, to construct an (n/2)-factorization of Q n , where n is even, where the factors have diameter n + Θ(1). This factorization was first given in [9]. Consider Q n , where n is even.…”
Section: Constructing Factorizations Of Q N From Variations On Reducementioning
confidence: 99%
“…We use the idea behind reduced and thin hypercubes, to construct an (n/2)-factorization of Q n , where n is even, where the factors have diameter n + Θ(1). This factorization was first given in [9]. Consider Q n , where n is even.…”
Section: Constructing Factorizations Of Q N From Variations On Reducementioning
confidence: 99%