Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Distributed algorithm for finding a core of a tree network

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

DOI10.1007/3-540-60609-2_22zbMATH Open1542.68151MaRDI QIDQ6573933FDOQ6573933


Authors: Esther Jennings Edit this on Wikidata


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


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6573933&oldid=40114966"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:32. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki