A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

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

Publisher： Springer Publishing Company

ISSN： 0920-8542

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

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. II. Grids and k-fault-tolerance

By Karavai M.  

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

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

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

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

By Nikolopoulos S.D.  

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 48-67

Elsevier

Access to resources Recommend Favorite

Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs

By Mujuni Egbert  

Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. : 701-708

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Finding a Second Hamiltonian Cycle in Cubic Graphs

By Krawczyk A.  

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 641-647

Academic Press

Access to resources Recommend Favorite