SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS (Q4675877): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / 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: A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees / 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: A belated proof of self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782251 / 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: Fast parallel reordering and isomorphism testing of \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time self-stabilizing colorings / rank
 
Normal rank

Latest revision as of 11:08, 10 June 2024

scientific article; zbMATH DE number 2166002
Language Label Description Also known as
English
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
scientific article; zbMATH DE number 2166002

    Statements