Construction of maximum cycles in faulty binary hypercubes

Author： Parkhomenko P.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 0005-1179

Source： Automation and Remote Control, Vol.66, Iss.4, 2005-04, pp. : 633-645

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links

By Wang D.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 4, 2001-04 ,pp. : 545-564

Academic Press

Access to resources Recommend Favorite

Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes

By Raghavendra C.S.   Sridhar M.A.  

Journal of Parallel and Distributed Computing, Vol. 35, Iss. 1, 1996-05 ,pp. : 57-66

Academic Press

Access to resources Recommend Favorite

How to Systematically Embed Cycles in Balanced Hypercubes

By  

International Journal of Software Innovation (IJSI), Vol. 5, Iss. 1, 2017-01 ,pp. : 44-56

IGI Global_journal

Access to resources Recommend Favorite

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

By Heun V.   Mayr E.W.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 8, 2001-08 ,pp. : 1110-1125

Academic Press

Access to resources Recommend Favorite

Embedding Large Complete Binary Trees in Hypercubes with Load Balancing

By Efe K.  

Journal of Parallel and Distributed Computing, Vol. 35, Iss. 1, 1996-05 ,pp. : 104-109

Academic Press

Access to resources Recommend Favorite