Distributed edge coloration for bipartite networks (Q2377126): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Time Optimal Asynchronous Self-stabilizing Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / 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: Q2782251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel composition for time-to-fault adaptive stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilization of dynamic systems assuming only read/write atomicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel I/O scheduling using randomized, distributed edge coloring algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for edge coloring bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Link scheduling in wireless sensor networks: distributed edge-coloring revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal distributed edge coloring in O(log log n) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing time-adaptive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: K�nig's edge coloring theorem without augmenting paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems / rank
 
Normal rank

Latest revision as of 14:49, 6 July 2024

scientific article
Language Label Description Also known as
English
Distributed edge coloration for bipartite networks
scientific article

    Statements

    Distributed edge coloration for bipartite networks (English)
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    distributed system
    0 references
    edge coloring
    0 references
    fault-tolerance
    0 references
    self-stabilization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references