scientific article; zbMATH DE number 1138356

MaRDI QIDQ4383618zbMATH OpenFDO

Authors Arun K. Somani, Sangbang Choi

Publication date 16 July 1998

zbMATH Keywords

binary treeshypercuberouting algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2062237
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• scientific article; zbMATH DE number 1270449
• Simulation of complete binary tree structures in a faulty flexible hypercube

Cited in

(8)

• Embedding of binomial trees in hypercubes with link faults
• Simulation of complete binary tree structures in a faulty flexible hypercube
• On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
• On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
• scientific article; zbMATH DE number 1270449 (Why is no real title available?)
• scientific article; zbMATH DE number 2062237 (Why is no real title available?)
• The parallel complexity of tree embedding problems (extended abstract)
• Reconfiguring binary tree structures in a faulty supercube with unbounded expansion

This page was built for publication:

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