We further show that, it is not sufficient for the base graph to have Hamiltonian path for the OTIS constructed on it to be Hamiltonian. We give constructive proof of Hamiltonicity for a large family of Butterfly-OTIS. This proof leads to an alternate efficient algorithm for independent ...
time or to extract only the lowest or the highest eigenvalue first and then sequentially determine the next few higher 9lower)eigenvalues.The algorithm is generalized to handle diagonalization problems in which the basis functions themselves areoptimized simultaneously.Several model applications are ...
Based on this model, we propose two efficient multicast routing algorithms, uniform multicast routing algorithm and fixed multicast routing algorithm, in symmetric networks with wormhole routing. The proposed multicast routing algorithms utilizes channels uniformly to reduce the path length of message worms...
Simulation results show that the multicast latency of the proposed multipath-HCM routing algorithm is superior to that of fixed and dual-path routing algorithms.Neng-Chung Wang and Yi-Ping HungJournal of Systems ArchitectureWang,NC,Yen,CP,Chu,CP.Multicast communication in wormhole-routed symmetric ...