Optimal fault-tolerant routings for connected graphs (Q1186600): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient fault-tolerant routings in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at fault-tolerant network routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant routings in a \(\kappa\)-connected network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fault tolerant routings in general networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for bipartition of biconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs / rank
 
Normal rank

Latest revision as of 16:07, 15 May 2024

scientific article
Language Label Description Also known as
English
Optimal fault-tolerant routings for connected graphs
scientific article

    Statements

    Optimal fault-tolerant routings for connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    distributed computing
    0 references
    routing
    0 references
    diameter
    0 references
    fault-tolerance
    0 references

    Identifiers