Sciweavers

38 search results - page 5 / 8
» Hamiltonian fault-tolerance of hypercubes
Sort
View
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 8 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
ENDM
2007
104views more  ENDM 2007»
13 years 7 months ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
Jirí Fink
IPPS
2003
IEEE
14 years 18 days ago
On Self-Similarity and Hamiltonicity of Dual-Cubes
The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the...
Changfu Wu, Jie Wu
ENGL
2008
79views more  ENGL 2008»
13 years 7 months ago
The Hamiltonicity of Crossed Cubes in the Presence of Faults
The crossed cube is considered as one of the most promising variations of the hypercube topology, due to its ability of preserving many of the attractive properties of the hypercub...
Emad Abuelrub
IPPS
1997
IEEE
13 years 11 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen