A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks (Q5357510): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quick method for finding shortest pairs of disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for computing shortest pairs of disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global wire routing in two-dimensional arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Daemon Conversions in Distributed Self-stabilizing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building self-stabilizing overlay networks with the transitive closure framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for constructing spanning trees / rank
 
Normal rank

Latest revision as of 08:50, 14 July 2024

scientific article; zbMATH DE number 6773509
Language Label Description Also known as
English
A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
scientific article; zbMATH DE number 6773509

    Statements

    A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks (English)
    0 references
    0 references
    0 references
    0 references
    8 September 2017
    0 references
    all node-disjoint paths
    0 references
    two node-disjoint paths
    0 references
    distributed systems
    0 references
    fault-tolerance
    0 references
    stabilization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references