A. L. Rosenberg, "Cycles in networks," Tech. Rep. UM-CS-1991-020, University of Massachusetts, Computer and Information Science, 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Embedding graphs onto the Supercube - Auletta, Rescigno, Scarano (1995) (3 citations) (Correct)
....of 2) are spanning subgraphs of the Supercube. Then we prove that the Supercube is an Hamiltonian graph and, when the number of nodes is not a power of 2, it contains all cycles of length greater than 3 as subgraphs, i.e. it is pancyclic. Only few graphs, as the De Bruijn graph [12] the X tree [7] and Product Shuffle network [8] are known to have such characteristic. These results are also used to prove that the Butterfly can be embedded onto the Supercube with dilation and congestion 2. 2 Definitions In the sequel the (Hamming) distance d(x; y) of two binary strings x and y is defined ....
A. Rosenberg, "Cycles in Networks", Technical Report 91-20 of Comp. and Inf. Science Dept. of Univ. of Massachusetts at Amherst, 1991.
Tr-93-08-08 - Wayne State University (Correct)
No context found.
A. L. Rosenberg, "Cycles in networks," Tech. Rep. UM-CS-1991-020, University of Massachusetts, Computer and Information Science, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC