Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A self-stabilizing algorithm which finds a 2-center of a tree

From MaRDI portal
Publication:1586255
Jump to:navigation, search

DOI10.1016/S0898-1221(00)00183-8zbMath0971.68218MaRDI QIDQ1586255

Ji-Cherng Lin, Tetz C. Huang, Hsueh-Jen Chen

Publication date: 13 November 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)


zbMATH Keywords

self-stabilizing algorithm


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)


Related Items (5)

Embeddings into almost self-centered graphs of given radius ⋮ Almost self-centered graphs ⋮ A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives ⋮ A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity ⋮ Center location problems on tree graphs with subtree-shaped customers



Cites Work

  • Unnamed Item
  • A belated proof of self-stabilization
  • Self-stabilizing systems in spite of distributed control
  • Self-Stabilizing Algorithms for Finding Centers and Medians of Trees




This page was built for publication: A self-stabilizing algorithm which finds a 2-center of a tree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1586255&oldid=13875306"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki