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 algorithms for tree traversals

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

DOI10.1016/0167-8191(85)90026-2zbMath0576.68054OpenAlexW2069630142MaRDI QIDQ1064788

N. C. Kalra, P. C. P. Bhatt

Publication date: 1985

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(85)90026-2


zbMATH Keywords

binary treeforestSIMDread-conflict


Mathematics Subject Classification ID

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


Related Items (2)

A unified approach to parallel depth-first traversals of general trees ⋮ Breadth-first traversal of trees and integer sorting in parallel







This page was built for publication: Parallel algorithms for tree traversals

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