Longest fault-free paths in star graphs with vertex faults

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 215-227

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

All-Pairs Bottleneck Paths in Vertex Weighted Graphs

By Shapira Asaf Yuster Raphael Zwick Uri

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 621-633

Springer Publishing Company

Access to resources Recommend Favorite

Maintaining Longest Paths Incrementally

By Katriel Irit Michel Laurent Hentenryck Pascal

Constraints, Vol. 10, Iss. 2, 2005-04 ,pp. : 159-183

Springer Publishing Company

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

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

Construction of vertex-disjoint paths in alternating group networks

By Zhou Shuming Xiao Wenjun Parhami Behrooz

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 206-228

Springer Publishing Company

Access to resources Recommend Favorite