A self-stabilizing algorithm for finding weighted centroid in trees

DOI10.2478/V10065-012-0035-XMaRDI QIDQ2443010zbMATH OpenOpenAlexFDO

Authors Halina Bielak, Michał Pańczyk

Publication date 2 April 2014

Published in Annales Universitatis Mariae Curie-Sklodowska, sectio AI – Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
• A self-stabilizing algorithm which finds a 2-center of a tree
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• Constant space self-stabilizing center finding algorithms in chains and trees

Cites work

• A self-stabilizing algorithm for finding weighted centroid in trees
• A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
• scientific article; zbMATH DE number 3328106 (Why is no real title available?)
• Self-stabilization
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• Self-stabilizing systems in spite of distributed control
• The Two-Triangle Case of the Acquaintance Graph

Cited in

(12)

• A self-stabilizing distributed algorithm to find the median of a tree graph
• A self-stabilizing algorithm which finds a 2-center of a tree
• The w-centroids and least w-central subtrees in weighted trees
• Trees with unique least central subtrees
• A self-stabilizing algorithm for finding weighted centroid in trees
• w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees
• A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• Constant space self-stabilizing center finding algorithms in chains and trees
• A new linear-time algorithm for centroid decomposition
• Polylogarithmic time algorithms for shortest path forests in programmable matter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443010)