A self-stabilizing algorithm for the st-order problem

DOI10.1080/17445760701536134zbMath1147.68880OpenAlexW2086300671MaRDI QIDQ3499020

Pranay Chaudhuri, Hussein Thompson

Publication date: 19 May 2008

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760701536134

zbMATH Keywords

distributed systemsanalysis of algorithmsgraph algorithmsgraph labeling\(st\)-number\(st\)-order

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets

Cites Work

• Unnamed Item
• Unnamed Item
• Linear time self-stabilizing colorings
• st-ordering the vertices of biconnected graphs
• A self-stabilizing algorithm for constructing spanning trees
• A self-stabilizing algorithm for constructing breadth-first trees
• A self-stabilizing algorithm for maximal matching
• A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing depth-first search
• A dynamic self-stabilizing algorithm for constructing a transport net
• A self-stabilizing algorithm for detecting fundamental cycles in a graph
• Self-stabilizing systems in spite of distributed control
• Principles of Distributed Systems

This page was built for publication: A self-stabilizing algorithm for the st-order problem