EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES*

DOI10.1080/01495739808947362zbMATH Open0915.68004OpenAlexW2074146561MaRDI QIDQ4226499FDOQ4226499

Authors: Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang 

Publication date: 22 June 1999

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495739808947362

Recommendations

• An approach to emulating separable graphs
• Simulation of binary trees and \(X\)-trees on pyramid networks
• Optimal emulations by butterfly-like networks

zbMATH Keywords

emulationX-tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Mathematical problems of computer architecture (68M07)

Cited In (1)

• Optimal dynamic embedding of X-trees into arrays

This page was built for publication: EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226499)