34 search results - page 1 / 7 » An Algorithm for Constructing Hamiltonian Cycle in Metacube ... |
PDCAT
2007
Springer
13 years 11 months ago
2007
Springer
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. ...
TJS
2010
13 years 3 months ago
2010
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks in such supercomputers play an important role for achi...
LATIN
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
IEEECIT
2009
IEEE
13 years 2 months ago
2009
IEEE
Recursive Dual-Net (RDN) was proposed recently as an effective, high-performance interconnection network for supercomputers with millions of nodes. A Recursive DualNet RDN(B) is r...
SPAA
1993
ACM
13 years 9 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...