[PDF] Top 20 Longest fault-free paths in star graphs with vertex faults
Has 10000 "Longest fault-free paths in star graphs with vertex faults" found on our website. Below are the top 20 most common "Longest fault-free paths in star graphs with vertex faults".
Embed longest rings onto star graphs with vertex faults
... The star graph has been recognized as an attractive alternative to the ...of vertex faults and edge faults, ...n-dimensional star graph can embed a ring of length n! if |F e | ≤ n-3 (|F ... See full document
8
The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks 劉驥雷、洪春男
... ”Longest fault-free paths in Star Graphs with Vertex Faults,” Theoretical Computer Science, ...”Longest fault-free paths ... See full document
2
The Study of Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs 歐宗翰、洪春男
... “Hamiltonian paths with prescribed edges in hypercubes,” Discrete Mathematics 307 (2007) ...“Conditional fault-tolerant hamiltonicity of star graphs,” Parallel Computing, 33, ... See full document
2
The study of the adjacent vertices fault-tolerance for two spannability of star graphs 塗博勳、洪春男
... embedding in faulty star graphs,” IEICE ...embedding in star graphs with more conditional faulty edges,” Applied Mathematics and Computation, 218, ...“Conditional ... See full document
3
Adjacent vertices fault tolerance hamiltonian laceability of star graphs 楊俊彥、洪春男
... “Longest paths and cycles in faulty hypercubes,” Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, ...“Embedding longest ... See full document
2
Fault-free longest paths in star networks with conditional link faults
... The star network, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed ...computing. In this paper, adopting the conditional ... See full document
10
Fault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults
... the longest fault-free path. Since an n-dimensional star graph is regular of degree n-1, |F e |=n-3 is maximum in the worst case, in order to embed a longest ... See full document
31
Fault-free Hamiltonian cycles in alternating group graphs with conditional edge faults
... Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed ...computing. In this paper, adopting the conditional fault model in which each vertex ... See full document
10
Hamiltonian-Laceability in Star Graphs with Conditional Edge Faults
... link faults may occur in real world networks, fault tolerance is an important research subject of the multi-process computer ...4) with ≤ 2n − 7 edge faults in which each node is ... See full document
9
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
... any vertex can be constructed recursively in the star graph interconnection network (for the detailed definitions, see Sections 2 and ...interest in the area of parallel and distributed com- ... See full document
18
Long paths in hypercubes with conditional node-faults
... two fault-free neighbors while a long path is constructed between every pair of fault-free ...a fault-free node with only one fault-free neighbor, namely ... See full document
15
Embedding paths of variable lengths into hypercubes with conditional link-faults
... short) with respect to path embedding of variable lengths in the range from the shortest to the ...links in a wounded n-cube Q
2
Vertex fault tolerance for edge-bipancyclicity of hypercube
... |. In [8], Li et ...general vertex fault tolerant Hamiltonian properties of hypercube Q n = (V b ∪ V w , ...embedding fault-free cycles or paths for hypercube with faulty ... See full document
9
Feedback Vertex Sets in Star Graphs
... Abstract In a graph G = (V, E), a subset F (G) of V (G) is a feedback vertex set if the subgraph induced by V (G) \ F (G) is ...acyclic. In this paper, we find a lower bound and an upper bound to the ... See full document
13
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
... received in revised form 23 April 2007; accepted 19 May 2007 Abstract The crossed cube, which is a variation of the hypercube, possesses some properties superior to the ...hypercube. In this paper, assuming ... See full document
11
Fault-free Hamiltonian cycles in faulty butterfly graphs
... r-dimensional k-ary butterfly graph with 2k - 2 edge faults contains a Hamiltonian cycle. However, the proof seems very hard[r] ... See full document
6
Cycle Embedding on the Edge Fault Star Graphs
... Edge Fault Star Graphs Tseng-Kuei Li ∗ Abstract The star graph is one of the famous interconnection ...Edge fault tol- erance is an important issue for a ...discussed in many ... See full document
9
Fault-Free Ring Embedding in Faulty Wrapped Butterfly Graphs
... 1 INTRODUCTION Performance of the distributed system is significantly de- termined by the choice of the network topology. The hyper- cube (binary n-cube) is one of the most popular interconnec- tion networks. It has been ... See full document
4
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
... guest graphs to host ...studies in recent ...algorithms with low communica- tion ...deals with all possible length of the cycles in a given graph, is investigated in a lot of ... See full document
6
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
... role in parallel computing/communication ...issue in evaluating a ...guest graphs to host ...studies in recent ...algorithms with low communication ...deals with all possible ... See full document
7
相關主題