A self-stabilizing graph algorithm: Finding the cutting center of a tree
From MaRDI portal
Publication:4464264
DOI10.1080/00207160310001650062zbMATH Open1046.68137OpenAlexW2130482879MaRDI QIDQ4464264FDOQ4464264
Authors: 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
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
- A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
- A linear algorithm for the cutting center of a tree
- A self-stabilizing algorithm for finding weighted centroid in trees
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Distributed algorithms (68W15)
Cites Work
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilizing systems in spite of distributed control
- Self-stabilizing depth-first search
- A self-stabilizing algorithm for constructing spanning trees
- A linear algorithm for the cutting center of a tree
- A self-stabilizing algorithm for detecting fundamental cycles in a graph
- An \(O(n^2)\) self-stabilizing algorithm for computing bridge-connected components
- Self-stabilization (in spite of distributed control) in tree-structured systems
Cited In (8)
- A self-stabilizing algorithm for cut problems in synchronous networks
- A linear algorithm for the cutting center of a tree
- A self-stabilizing algorithm which finds a 2-center of a tree
- On bounds for the cutting number of a graph
- Self-stabilizing Cuts in Synchronous Networks
- A self-stabilizing algorithm for finding weighted centroid in trees
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
This page was built for publication: A self-stabilizing graph algorithm: Finding the cutting center of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464264)
