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

A simple optimal parallel algorithm for a core of a tree

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

DOI10.1006/JPDC.1994.1035zbMath0805.68049OpenAlexW2087785155MaRDI QIDQ1325996

Win-Tsung Lo, Shietung Peng

Publication date: 15 May 1994

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1994.1035


zbMATH Keywords

parallel algorithmnetwork locationEREW PRAMrooted corecore of treeoptimal point location


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)


Related Items (2)

Finding the conditional location of a median path on a tree ⋮ Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network







This page was built for publication: A simple optimal parallel algorithm for a core of a tree

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