Compact embedding of binary trees into hypercubes

DOI10.1016/0020-0190(95)00010-AzbMATH Open1022.68594OpenAlexW1937416524MaRDI QIDQ673463FDOQ673463

Authors: Chui-Cheng Chen, Rong-Jaye Chen 

Publication date: 28 February 1997

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

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

Recommendations

• Embedding complete binary trees into hypercubes
• scientific article; zbMATH DE number 1472115
• Efficient Embeddings of Trees in Hypercubes
• Embedding complete trees into the hypercube
• Efficient Dynamic Embeddings of Binary Trees into Hypercubes
• Embedding complete ternary trees into hypercubes
• Embedding a subclass of trees into hypercubes
• Optimal dynamic embeddings of complete binary trees into hypercubes
• Efficient embeddings of ternary trees into hypercubes.
• On Oriented Embedding of the Binary Tree into the Hypercube

zbMATH Keywords

hypercubeembeddingbinary tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• On cubes and dichotomic trees
• Embedding complete binary trees into hypercubes
• Embedding the complete tree in the hypercube

Cited In (18)

• Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes
• Embedding a subclass of trees into hypercubes
• Two new classes of trees embeddable into hypercubes
• Embedding binary trees into crossed cubes
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Dense sets and embedding binary trees into hypercubes
• On embedding of certain recursive trees and stars into hypercube
• Incomplete hypercubes: Embeddings of tree-related networks
• Complete binary trees in folded and enhanced cubes
• Salvage-Embeddings of Complete Trees
• A note on the cubical dimension of new classes of binary trees.
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Title not available (Why is that?)
• On Oriented Embedding of the Binary Tree into the Hypercube
• Title not available (Why is that?)
• Title not available (Why is that?)
• Binary space partitioning trees as an alternative representation of polytopes

This page was built for publication: Compact embedding of binary trees into hypercubes

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