Distributed algorithm for finding a core of a tree network
From MaRDI portal
Publication:6573933
DOI10.1007/3-540-60609-2_22zbMATH Open1542.68151MaRDI QIDQ6573933FDOQ6573933
Authors: Esther Jennings
Publication date: 17 July 2024
Recommendations
- Parallel algorithm for finding a core of a tree network
- Distributed Algorithms for Finding Central Paths in Tree Networks
- Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Algorithms for a Core and k-Tree Core of a Tree
Cites Work
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Distributed algorithms for finding centers and medians in networks
- A linear algorithm for a core of a tree
- Title not available (Why is that?)
- A simple optimal parallel algorithm for a core of a tree
- On finding the core of a tree with a specified length
- Parallel algorithm for finding a core of a tree network
This page was built for publication: Distributed algorithm for finding a core of a tree network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573933)