[PDF] Top 20 Fault-free Hamiltonian cycles in faulty butterfly graphs
Has 10000 "Fault-free Hamiltonian cycles in faulty butterfly graphs" found on our website. Below are the top 20 most common "Fault-free Hamiltonian cycles in faulty butterfly graphs".
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
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
... independent Hamiltonian cycles rooted at any vertex can be constructed recursively in the star graph interconnection network (for the detailed definitions, see Sections 2 and ...interest in ... See full document
18
Fault-Free Ring Embedding in Faulty Wrapped Butterfly Graphs
... wrapped butterfly net- work is one of the most promising networks due to its nice topological ...wrapped butterfly network has received many re- searchers’ efforts in recent years [1, 3, 5, 6, ...a ... See full document
4
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 is ... See full document
10
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
... Introduction In many parallel computer systems, processors are connected on the basis of in- terconnection networks such as hypercubes, star graphs, meshes, bubble-sort net- works, ...graph, ... See full document
11
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
... From such a point of view, the presented result is optimal. Thus, not only does our improvement increase the number of mutually independent fault-free Hamiltonian cycles by one, but also the ... See full document
17
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
... topologies, butterfly networks are very suitable for VLSI implementation and parallel ...computing. In particular, the binary wrapped butterfly graph has gained many researchers’ efforts for its nice ... See full document
12
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
... conditional fault model assumed that the distribution of faults was subject to some constraint, ...more fault-free links incident to each node. In this paper, under the conditional ... See full document
7
Cycle embedding in faulty wrapped butterfly graphs
... Keywords: Hamiltonian cycle; wrapped butterfly; fault-toler- ant; cycle embedding; Cayley graph 1. INTRODUCTION The performance of a distributed system is significantly determined by its network topology. The ... See full document
12
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
... no fault-free Hamiltonian cycle exists in the faulty CQ n ...assumed in Theorem 1 that each node in CQ n is incident with at least two fault-free links, ... See full document
11
Construction for fault-tolerant Hamiltonian and Hamiltonian-connected graphs
... use graphs and networks ...implementation. Fault tolerance is also important in parallel systems that have a relatively high probability of ...pancake graphs, faulty hypercubes, stars, ... See full document
10
The Hamiltonian properties for faulty pancake graphs 梁高源、洪春男
... Longest fault-free paths in star graphs with vertex faults, Theoretical Computer Science 262, ...of cycles in pancake graphs, Parallel Computing, 2, ... See full document
2
Adjacent vertices fault tolerance hamiltonian laceability of star graphs 楊俊彥、洪春男
... graph. In this paper, we show that Sn ?F is Hamiltonian laceable where F is the set of f ?(n?4) pairs of adjacent faulty vertices, Sn?F is Hamiltonian where F is the set of f ?(n?3) pairs of ... See full document
2
The Study of Edge Fault-Tolerance for Hamiltonian Cycles and Hamiltonian Paths Passing through Prescribed Edges of Star 游宗育、洪春男
... [7]K. Efe, ``A variation on the hypercube with lower diameter'', IEEE Transactions on Computers, pp. 1213-1316, 1991. [8]S. Gao, B. Novick and K. Qiu, ``From hall's matching theorem to optimal routing on hypercubes,'' ... See full document
2
Hamiltonian-Laceability in Star Graphs with Conditional Edge Faults
... occur in real world networks, fault tolerance is an important research subject of the multi-process computer ...faults in which each node is incident to at least two healthy edges, a ... See full document
9
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
... arrangement graphs [9,12], ...two fault-free edges, a wounded k-ary n-cube still has a hamiltonian circuit, provided that there are no more than 4n−5 faulty ...both faulty nodes ... See full document
7
The Study of Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs 歐宗翰、洪春男
... longest fault-free paths onto star graphs with more vertex faults,” ...“Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults,” Journal of Supercomputing, 49, ... 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
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
... contained in the publications on our ...expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & ...indirectly in connection with, ... See full document
16
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
... independent hamiltonian cycles Mutually independent hamiltonicity of graphs can be applied to many ...scenario. In Christmas, we have a holiday of ...stay in each local area is limited, ... See full document
10
相關主題