Connectivity and fault-tolerance of hyperdigraphs (Q1348372): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 15:11, 31 January 2024

scientific article
Language Label Description Also known as
English
Connectivity and fault-tolerance of hyperdigraphs
scientific article

    Statements

    Connectivity and fault-tolerance of hyperdigraphs (English)
    0 references
    0 references
    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

    Identifiers