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

Parallel algorithm for finding a core of a tree network

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

DOI10.1016/0020-0190(94)00102-2zbMath0821.68062OpenAlexW2051616349MaRDI QIDQ1336753

Eliezer A. Albacea

Publication date: 3 November 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00102-2


zbMATH Keywords

coreoptimal parallel algorithm


Mathematics Subject Classification ID

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





Cites Work

  • On finding the core of a tree with a specified length
  • A linear algorithm for a core of a tree
  • A simple parallel tree contraction algorithm
  • Unnamed Item




This page was built for publication: Parallel algorithm for finding a core of a tree network

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1336753&oldid=13462643"
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 13:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki