Dense edge-disjoint embedding of complete binary trees in the hypercube

DOI10.1016/0020-0190(93)90044-AzbMath0768.68174OpenAlexW2001791680MaRDI QIDQ2365823

Somasundaram Ravindran, Alan M. Gibbons

Publication date: 29 June 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90044-a

zbMATH Keywords

parallel algorithmscomplete binary treegraph embeddinghybercube

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Mathematical problems of computer architecture (68M07) Distributed algorithms (68W15)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item

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