Distributed Algorithms for Finding Central Paths in Tree Networks

DOI10.1093/COMJNL/42.7.609MaRDI QIDQ4943469zbMATH OpenOpenAlexFDO

Authors Esther Jennings

Publication date 16 March 2000

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c3c8ab065d91198b9780655e1c0701c1c262796c

zbMATH Keywords

asynchronous tree networksdistributed algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• Distributed algorithms for finding centers and medians in networks
• scientific article; zbMATH DE number 2081036
• Parallel algorithm for finding a core of a tree network
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Finding the two-core of a tree

Cited in

(8)

• A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
• Distributed algorithms for finding centers and medians in networks
• A generalized algorithm for centrality problems on trees
• scientific article; zbMATH DE number 2081036 (Why is no real title available?)
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Distributed Relationship Schemes for Trees
• Distributed algorithm for finding a core of a tree network
• An efficient distributed algorithm for centering a spanning tree of a biconnected graph

This page was built for publication: Distributed Algorithms for Finding Central Paths in Tree Networks

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