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

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199905)33:3<221::AID-NET8>3.0.CO;2-K" /><221::AID-NET8>3.0.CO;2-K 10.1002/(SICI)1097-0037(199905)33:3<221::AID-NET8>3.0.CO;2-KzbMath0923.05020OpenAlexW2026795585MaRDI QIDQ4254358

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

Publication date: 28 October 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<221::aid-net8>3.0.co;2-k

zbMATH Keywords

embeddingparallel algorithminterconnection networkcomplete binary treestar

Mathematics Subject Classification ID

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

Related Items (4)

On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ Unnamed Item

Cites Work

• Unnamed Item

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