Embedding complete binary trees in product graphs

DOI10.1007/3-540-62559-3_6MaRDI QIDQ6550533zbMATH OpenFDO

Authors Adrienne Broadwater, Kemal Efe, A. J. Fernández

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/3-540-62559-3_6

Mathematics Subject Classification ID

Trees (05C05) Graph operations (line graphs, products, etc.) (05C76) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Dense edge-disjoint embedding of complete binary trees in interconnection networks
• Optimal embedding of complete binary trees into lines and grids
• Incomplete hypercubes: Embeddings of tree-related networks
• Embedding large complete binary trees in hypercubes with load balancing
• scientific article; zbMATH DE number 219230

Cites work

• Embedding large complete binary trees in hypercubes with load balancing
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Quotient Networks

This page was built for publication: Embedding complete binary trees in product graphs

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