2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.
DOI: 10.1109/prdc.2002.1185630
|View full text |Cite
|
Sign up to set email alerts
|

Fault-tolerant properties of generalized hierarchical completely-connected networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…To describe the network as a graph, terms and notations used in [18,19] are adopted here for HCC. Let a network G be an undirected graph G = (V,E), where V is a node set and E a link set.…”
Section: Hcc: Generalized Hierarchical Completely-connected Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…To describe the network as a graph, terms and notations used in [18,19] are adopted here for HCC. Let a network G be an undirected graph G = (V,E), where V is a node set and E a link set.…”
Section: Hcc: Generalized Hierarchical Completely-connected Networkmentioning
confidence: 99%
“…Among many hierarchical networks [2], [3], [5], [8], [11], [14], [18], [19], [20], Generalized Hierarchical Completely-Connected Networks (for short, HCC) [18], [19] are suitable for such systems, because they have a constant node-degree regardless of the increase in size (the number of nodes). The HCC have their characteristics of expansibility, uniformity, and symmetry.…”
Section: Introductionmentioning
confidence: 99%