A self-stabilizing graph algorithm: Finding the cutting center of a tree (Q4464264)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2067698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A self-stabilizing graph algorithm: Finding the cutting center of a tree |
scientific article; zbMATH DE number 2067698 |
Statements
A self-stabilizing graph algorithm: Finding the cutting center of a tree (English)
0 references
27 May 2004
0 references
distributed algorithm
0 references
self-stabilizing algorithm
0 references
cutting center
0 references
0.8700920343399048
0 references
0.8510935306549072
0 references
0.8510935306549072
0 references
0.8228372931480408
0 references
0.8058295249938965
0 references
A vertex is called cutting center of a tree \(T\) if its removal from \(T\) separates a maximum number of pairs of vertices, see \textit{F. Harary} and \textit{P. J. Slater} [Inf. Process. Lett. 23, 317--319 (1986; Zbl 0624.68058)]. The distributed self-stabilizing algorithm proposed here requires \(O(n^2)\) moves.
0 references
