Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests: Optimal sublogarithmic time parallel algorithms on rooted forests

Συγγραφείς: Sanjeev Saxena, G. Sajith

Πηγή: Algorithmica. 27:187-197

Θεματικοί όροι: Graph theory (including graph drawing) in computer science, sublogarithmic time optimal parallel algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica27.html#SajithS00
https://link.springer.com/article/10.1007%2Fs004530010012