Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II. Grids and k-fault-tolerance

Author： Karavai M.

Publisher： MAIK Nauka/Interperiodica

ISSN： 0005-1179

Source： Automation and Remote Control, Vol.66, Iss.2, 2005-02, pp. : 328-340

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

Minimized Embedding of Arbitrary Hamiltonian Graphs in Fault-tolerant Graph and Reconfiguration at Faults. I. One-fault-tolerant Structures

By Karavai M. F.

Automation and Remote Control, Vol. 65, Iss. 12, 2004-12 ,pp. : 2003-2019

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Fault-tolerant cycle embedding in dual-cube with node faults

By Li Yamin Peng Shietung Chu Wanming

International Journal of High Performance Computing and Networking, Vol. 3, Iss. 1, 2005-09 ,pp. : 45-53

Inderscience Publishers

Access to resources Recommend Favorite

Fault-tolerant cycle embedding in the hypercube

By Fu J.-S.

Parallel Computing, Vol. 29, Iss. 6, 2003-06 ,pp. : 821-832

Elsevier

Access to resources Recommend Favorite

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

By Chen Y-Chuang Huang Yong-Zen Hsu Lih-Hsing Tan Jimmy

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 229-238

Springer Publishing Company

Access to resources Recommend Favorite

Fault-Tolerant Routing Algorithm in Meshes with Solid Faults

By Youn Jong-Hoon Bose Bella Park Seungjin

The Journal of Supercomputing, Vol. 37, Iss. 2, 2006-08 ,pp. : 161-177

Springer Publishing Company

Access to resources Recommend Favorite