Edge-Disjoint Hamiltonian Cycles of WK-Recursive Networks

In this paper, we show that there exist n edge-disjoint Hamiltonian cycles in the WK-Recursive networks with amplitude 2n +1. By the aid of these edge-disjoint Hamiltonian cycles, nearly optimal all-to-all broadcasting communication on all-port WK-Recursive networks can be derived.

Saved in:
Bibliographic Details
Published inApplied Parallel Computing. State of the Art in Scientific Computing Vol. 3732; pp. 1099 - 1104
Main Authors Huang, Chien-Hung, Fang, Jywe-Fei, Yang, Chin-Yang
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Disjoint edge
Parallel algorithm
Hamiltonian cycle
Distributed computing
Online AccessGet full text

Cover

More Information
Summary:In this paper, we show that there exist n edge-disjoint Hamiltonian cycles in the WK-Recursive networks with amplitude 2n +1. By the aid of these edge-disjoint Hamiltonian cycles, nearly optimal all-to-all broadcasting communication on all-port WK-Recursive networks can be derived.
ISBN:9783540290674
3540290672
ISSN:0302-9743
1611-3349
DOI:10.1007/11558958_132