Dense sets and embedding binary trees into hypercubes

DOI10.1016/J.DAM.2006.09.003MaRDI QIDQ869570zbMATH OpenOpenAlexFDO

Authors Tomáš Dvořák

Publication date 8 March 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.09.003

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)

Recommendations

• scientific article; zbMATH DE number 4064517
• Compact embedding of binary trees into hypercubes
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• On embedding of certain recursive trees and stars into hypercube
• Embedding the complete tree in the hypercube

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 4185639 (Why is no real title available?)
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• A survey of the theory of hypercube graphs
• Embedding Trees in a Hypercube is NP-Complete
• Embedding ladders and caterpillars into the hypercube
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• Optimal Assignments of Numbers to Vertices
• Optimal embeddings of odd ladders into a hypercube
• Parallel concepts in graph theory

Cited in

(21)

• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
• Embedding a subclass of trees into hypercubes
• Dense subtrees in complete Boolean algebras
• Embedding circulant networks into butterfly and benes networks
• On embedding subclasses of height-balanced trees in hypercubes
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Embedding of hypercubes into necklace, windmill and snake graphs
• Embedding of the folded hypercubes into tori
• A note on the cubical dimension of new classes of binary trees.
• scientific article; zbMATH DE number 4064517 (Why is no real title available?)
• Weakly binary expansions of dense meet‐trees
• Bothway embedding of circulant network into grid
• Embedding of hypercube into fractal cubic network
• Dense forests and Danzer sets
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
• scientific article; zbMATH DE number 1472115 (Why is no real title available?)
• scientific article; zbMATH DE number 7528054 (Why is no real title available?)
• Improved bound for dilation of an embedding onto circulant networks

Describes a project that uses

Uses Software

• IPSEN

This page was built for publication: Dense sets and embedding binary trees into hypercubes

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