A self-stabilizing graph algorithm: Finding the cutting center of a tree

DOI10.1080/00207160310001650062zbMath1046.68137OpenAlexW2130482879MaRDI QIDQ4464264

Pranay Chaudhuri, Hussein Thompson

Publication date: 27 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmself-stabilizing algorithmcutting center

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (1)

On bounds for the cutting number of a graph

Cites Work

• A linear algorithm for the cutting center of a tree
• A self-stabilizing algorithm for constructing spanning trees
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization (in spite of distributed control) in tree-structured systems
• An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
• Self-stabilizing depth-first search
• A self-stabilizing algorithm for detecting fundamental cycles in a graph
• Self-stabilizing systems in spite of distributed control

This page was built for publication: A self-stabilizing graph algorithm: Finding the cutting center of a tree