Search Constraints

Start Over
Filtering by: Creator Celia, M. A. Remove constraint Creator: Celia, M. A. Committee Member Nguyen, Thinh Remove constraint Committee Member: Nguyen, Thinh Committee Member Lee, Ben Remove constraint Committee Member: Lee, Ben Subject Electric network topology Remove constraint Subject: Electric network topology

Search Results

  • On edge disjoint Hamiltonian cycles in torus and Gaussian networks

    Creator:
    Alazemi, Fawaz M.
    Abstract:
    Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...
    Resource Type:
    Masters Thesis
    Full Text:
    of size m into md/2 = 2m d parts and send each part on a different Hamiltonian cycle. Hence, we