[PDF] Top 20 Fault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults
Has 10000 "Fault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults" found on our website. Below are the top 20 most common "Fault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults".
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 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 ... See full document
10
Cycle Embedding on the Edge Fault Star Graphs
... faulty star graphs. Since components in a network would fail sometimes, to study the graphs with faults in the researches is more ...practice. In this study, we ... See full document
9
Embed longest rings onto star graphs with vertex faults
... link faults may happen when a network is put in use, it is practically meaningful to consider faulty ...problems of diameter [28], routing [14, 34], multicasting [21], broadcasting [33], gossiping ... See full document
8
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 ... See full document
9
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
... conditional fault model and assuming that two or more non-faulty links are incident to each node, we show that a pancake graph with up to 2n − 7 link faults contains a fault-free Hamiltonian ... See full document
11
The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks 劉驥雷、洪春男
... hypercube with lower diameter”, IEEE Transactions on Computers, ...Journal of Combinatorial Theory, ...”Embedding Longest Fault-Free Paths onto Star Graphs ... See full document
2
The Study of Edge Fault-Tolerance for Hamiltonian Cycles and Hamiltonian Paths Passing through Prescribed Edges of Star 游宗育、洪春男
... hypercube with lower diameter'', IEEE Transactions on Computers, ...Journal of Combinatorial Theory, ...``Longest fault-free paths in Star Graphs with Vertex ... See full document
2
Construction for fault-tolerant Hamiltonian and Hamiltonian-connected graphs
... architecture of an interconnection network is always represented by a ...use graphs and networks ...easiness of implementation. Fault tolerance is also important in parallel systems ... See full document
10
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-tolerant ring embedding in faulty arrangement graphs
... cubes, and trees in arrangement graphs,” Proceed- ings of the International Conference on Parallel Processing, 1993, pp. Kanevsky, ”Embedding rings in recursive networks,” [r] ... See full document
6
Fault-free Hamiltonian cycles in alternating group graphs with conditional edge faults
... Department of Electronics Engineering, National United University, Miaoli, Taiwan, ROC * e-mail: ...class of Cayley graphs, is one of the most versatile interconnection networks for parallel ... See full document
10
Faithful 1-edge fault tolerant graphs
... these primal graphs having some desired properties, this scheme enables us to construct a l-EFT graph w.r.t.. the graph product.[r] ... See full document
9
Embedding paths of variable lengths into hypercubes with conditional link-faults
... Abstract:Faults in a network may take various forms such as hardware failures while a node or a link stops functioning, software errors, or even missing of transmitted ...packets. In this ... See full document
2
Embedding paths of variable lengths into hypercubes with conditional link-faults
... loss of generality, we assume that jFðQ j;0 n Þj P jFðQ j;1 n ...are in Q j;0 n ...0 of length 2 n1 2 between u and v ...set of disjoint links on H 0 ...bÞ of A such that ðw; ðwÞ j ... See full document
14
The paths embedding of the arrangement graphs with prescribed vertices in given position
... path of length |V (G)| − ...graph embedding problem is to ask if the guest graph is a subgraph of a host ...benefit of the graph embeddings is that we can apply existing algorithm for guest ... See full document
20
Distributed Fault Tolerant Embedding of Several Topologies in Hypercubes
... Keywords: fault-tolerant embedding, hypercube, ring, torus, binomial tree ...distribution, embedding, parallel proc- essing application, ...degree of connectivity. Therefore, in ... See full document
26
Fault-tolerant cycle-embedding of crossed cubes
... received in revised form 22 July 2003 Communicated by ...those of the popular hypercube. However, the diameter of CQ n is about one half of that of the ...Failures of links and ... See full document
6
Fault-Free Ring Embedding in Faulty Wrapped Butterfly Graphs
... Performance of the distributed system is significantly de- termined by the choice of the network ...one of the most popular interconnec- tion ...drawback with hyper- cubes is that the degree ... See full document
4
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 ...the longest ... See full document
15
相關主題