A self-stabilizing distributed algorithm to find the median of a tree graph

DOI10.1006/jcss.1998.1606zbMath0938.68148OpenAlexW2090426016MaRDI QIDQ1305938

Gheorghe Antonoiu, Pradip K. Srimani

Publication date: 21 June 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1606

zbMATH Keywords

protocol

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS ⋮ Self-stabilizing algorithms for minimal dominating sets and maximal independent sets ⋮ A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives ⋮ Median problem in some plane triangulations and quadrangulations.

Cites Work

• Unnamed Item
• Unnamed Item
• Stabilizing unison
• A belated proof of self-stabilization
• An exercise in proving self-stabilization with a variant function
• Self-stabilizing extensions for message-passing systems
• Self-stabilizing depth-first search
• Parallel concepts in graph theory
• Self-stabilizing systems in spite of distributed control
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
• Unifying self-stabilization and fault-tolerance
• Token systems that self-stabilize

This page was built for publication: A self-stabilizing distributed algorithm to find the median of a tree graph