Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks

DOI10.1007/S11786-011-0081-6zbMath1254.05170OpenAlexW2047291301MaRDI QIDQ691628

Hussein Thompson, Pranay Chaudhuri

Publication date: 3 December 2012

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-011-0081-6

zbMATH Keywords

complexitygraph coloringdistributed system\(L(21)\)-labelingself-stabilizing algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear time self-stabilizing colorings
• A self-stabilizing algorithm for constructing spanning trees
• A self-stabilizing algorithm for constructing breadth-first trees
• A self-stabilizing algorithm for maximal matching
• Self-stabilization of dynamic systems assuming only read/write atomicity
• A self-stabilizing algorithm for coloring planar graphs
• Self-stabilizing depth-first search
• Labeling trees with a condition at distance two.
• On \(L(d,1)\)-labelings of graphs
• A dynamic self-stabilizing algorithm for constructing a transport net
• A self-stabilizing algorithm for coloring bipartite graphs
• A self-stabilizing algorithm for detecting fundamental cycles in a graph
• \(L(h,1)\)-labeling subclasses of planar graphs
• Labelling Graphs with a Condition at Distance 2
• Self-stabilizing systems in spite of distributed control
• Approximations for  -Colorings of Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

This page was built for publication: Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks