Connectivity and fault-tolerance of hyperdigraphs (Q1348372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1742044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity and fault-tolerance of hyperdigraphs |
scientific article; zbMATH DE number 1742044 |
Statements
Connectivity and fault-tolerance of hyperdigraphs (English)
0 references
15 May 2002
0 references
The authors continue to study the interesting model of networks whose nodes are connected by directed buses. This model uses directed hypergraphs. The authors give an overview of the present results and some new resluts on the connectivity and the fault-diameter of directed hypergraphs.
0 references
networks
0 references
connectivity
0 references
fault-diameter
0 references
directed hypergraphs
0 references
0.8638104796409607
0 references
0.8638104796409607
0 references
0.800531804561615
0 references
0.7823711633682251
0 references
0.7823708653450012
0 references
