Search Constraints

Start Over
Filtering by: Creator Kirinicich, A. R. Remove constraint Creator: Kirinicich, A. R. Committee Member Nguyen, Thinh Remove constraint Committee Member: Nguyen, Thinh Creator Alazemi, Fawaz M. Remove constraint Creator: Alazemi, Fawaz M.

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:
    . 2.2.1 n = 2r EDHC on T nk where r ≥ 0 and k ≥ 3 In [5], the authors presented a recurrence function to