The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The crossed cube is an important variation of the hypercube. It possesses many desirable properties for interconnection networks. Hamiltonicity is a critical property in interconnection networks. In this paper, we study fault-tolerant embedding algorithms of Hamiltonian paths and cycles in crossed cubes. We provide two algorithms Hamiltonian path and Hamiltonian cycle. For any integer n ges 3, letting...
In this paper, we develop optimal routing algorithm and Hamiltonian cycle in Petersen-Torus network based on well-known Petersen graph. PT(m,n) is a regular graph where the number of nodes is 10 mn, the number of edges 20 mn and degree 4. Hamiltoinan cycle is made by using Hamiltonian path in Petersen graph. Optimal routing algorithm is made by using PT's diameter edge and node pairs.
We present and evaluate a new pyramid topology for interconnection networks, based on the recursive transpose-connected cycles (RTCC) network, which we refer to as the RTCC-pyramid. An L level RTCC-pyramid uses an RTCC network structure in each level as an alternative to the mesh network used to construct the conventional mesh-pyramid network. We study some important properties of these topologies...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.