A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2006.09.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Self-Stabilizing Algorithms for Finding Centers and Medians of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring planar graphs in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved edge-coloring algorithms for planar graphs / 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: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for coloring planar graphs / 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: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing coloration in anonymous planar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for edge coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental study of a simple, distributed edge-coloring algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs of maximum degree seven are Class I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2006.09.004 / rank
 
Normal rank

Latest revision as of 05:02, 10 December 2024

scientific article
Language Label Description Also known as
English
A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
scientific article

    Statements

    A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    distributed systems
    0 references
    edge coloring
    0 references
    planar graphs
    0 references
    self-stabilization
    0 references

    Identifiers