Dense edge-disjoint embedding of complete binary trees in interconnection networks

DOI10.1016/S0304-3975(00)00066-9zbMATH Open0949.68175OpenAlexW2001554837MaRDI QIDQ1583538FDOQ1583538

Authors: R. Smith 

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00066-9

Recommendations

• Dense edge-disjoint embedding of complete binary trees in the hypercube
• On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
• scientific article; zbMATH DE number 1103048
• Incomplete hypercubes: Embeddings of tree-related networks
• Embedding complete binary trees into star networks

zbMATH Keywords

hypercubegraph embeddingparallel algorithmsbinary treemeshshuffle-exchange networkDe Bruijn network

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An optimal routing algorithm for mesh-connected Parallel computers
• A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• The balanced binary tree technique on mesh-connected computers

Cited In (8)

• Dense edge-disjoint embedding of complete binary trees in the hypercube
• On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
• Tree embeddings for hop-constrained network design
• Wheel-augmented binary trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms and Computation
• Embedding complete binary trees in product graphs

This page was built for publication: Dense edge-disjoint embedding of complete binary trees in interconnection networks

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