scientific article; zbMATH DE number 1103048

DOI10.1002/(SICI)1097-0037(199712)30:4%3C283::AID-NET5%3E3.0.CO;2-FzbMATH Open0888.90145MaRDI QIDQ4369764FDOQ4369764

Authors: Hyeong-Ah Choi, Sang-Kyu Lee 

Publication date: 8 June 1998

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4862246
• scientific article; zbMATH DE number 139790
• Embedding meshes of trees into deBruijn graphs
• scientific article; zbMATH DE number 1760007
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
• Dense edge-disjoint embedding of complete binary trees in interconnection networks
• Dissections and trees, with applications to optimal mesh encoding and to random sampling

zbMATH Keywords

complete binary tree

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Trees (05C05)

Cited In (7)

• Separator-based graph embedding into multidimensional grids with small edge-congestion
• On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
• Title not available (Why is that?)
• Embedding meshes of trees into deBruijn graphs
• Title not available (Why is that?)
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• Dense edge-disjoint embedding of complete binary trees in interconnection networks

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 Q4369764)