Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs (Q1199456): 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: Authenticated Algorithms for Byzantine Agreement / 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: Optimal fault-tolerant routings for connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fault tolerant routings in general networks / rank
 
Normal rank

Latest revision as of 16:16, 16 May 2024

scientific article
Language Label Description Also known as
English
Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
scientific article

    Statements

    Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    communication network
    0 references
    node faults
    0 references
    graph
    0 references
    fault-tolerant measures
    0 references
    directed graphs
    0 references
    routings
    0 references