Sciweavers

10 search results - page 2 / 2
» Fault-tolerant graphs for hypercubes and tori
Sort
View
ISCI
2007
82views more  ISCI 2007»
13 years 5 months ago
On reliability of the folded hypercubes
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...
Qiang Zhu 0003, Jun-Ming Xu, Xinmin Hou, Min Xu
DM
2008
58views more  DM 2008»
13 years 6 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
SOFSEM
1997
Springer
13 years 10 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
11 years 8 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
NETWORKS
2006
13 years 5 months ago
Black hole search in common interconnection networks
Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...