Congestion-free, dilation-2 embedding of complete binary trees into star graphs

DOI10.1002/(SICI)1097-0037(199905)33:3%3C221::AID-NET8%3E3.0.CO;2-KMaRDI QIDQ4254358zbMATH OpenOpenAlexFDO

Authors Yu-Chee Tseng, Yuh-Shyan Chen, Tong-Ying Juang, Chiou-Jyu Chang

Publication date 28 October 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199905)33:3%3C221::aid-net8%3E3.0.co;2-k

zbMATH Keywords

complete binary treeembeddinginterconnection networkparallel algorithmstar

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Embedding an arbitrary binary tree into the star graph
• Embedding complete binary trees into star networks
• Embedding complete binary trees into star and Pancake graphs
• Optimal embedding of complete binary trees into lines and grids

Cited in

(11)

• On embedding graphs in trees
• Embedding complete binary trees into star and Pancake graphs
• Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion
• On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
• Linearly many faults in Cayley graphs generated by transposition trees
• Embedding an arbitrary binary tree into the star graph
• Embedding complete binary trees into star networks
• Embedding complete multipartite graphs into certain trees
• scientific article; zbMATH DE number 2230273 (Why is no real title available?)
• An upper bound for edge congestion and the exact wirelength of embedding onto BC graphs
• Complete binary trees embeddings in Möbius cubes

This page was built for publication: Congestion-free, dilation-2 embedding of complete binary trees into star graphs

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