A self-stabilizing algorithm for finding weighted centroid in trees

DOI10.2478/v10065-012-0035-xzbMath1283.68405OpenAlexW1966725839MaRDI QIDQ2443010

Michał Pańczyk, Halina Bielak

Publication date: 2 April 2014

Published in: Annales Universitatis Mariae Curie-Skłodowska. Sectio A1. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10065-012-0035-x

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (4)

The \(w\)-centroids and least \(w\)-central subtrees in weighted trees ⋮ Trees with unique least central subtrees ⋮ w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees ⋮ A self-stabilizing algorithm for finding weighted centroid in trees

Cites Work

• A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
• A self-stabilizing algorithm for finding weighted centroid in trees
• Self-stabilizing systems in spite of distributed control
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• The Two-Triangle Case of the Acquaintance Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: A self-stabilizing algorithm for finding weighted centroid in trees