Embeddings on a Boolean cube

DOI10.1007/BF02017346MaRDI QIDQ911244zbMATH OpenFDO

Authors N. E. Zubov

Publication date 1990

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

graphsembeddinginterconnection networksBoolean cubemesh of treestree of meshes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Recommendations

• Efficient Embeddings of Trees in Hypercubes
• Embedding the complete tree in the hypercube
• Embedding meshes of trees into deBruijn graphs
• Optimal embeddings of butterfly-like graphs in the hypercube
• Embedding a mesh of trees in the crossed cube

Cites work

• Cost Trade-offs in Graph Embeddings, with Applications
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• Efficient parallel convex hull algorithms
• Minimal mesh embeddings in binary hypercubes
• On embedding rectangular grids in hypercubes

Cited in

(5)

• Realization of Boolean functions by combinational circuits embedded in the hypercube
• scientific article; zbMATH DE number 966834 (Why is no real title available?)
• Ordering the Boolean cube vectors by their weights and with minimal change
• Cover-preserving order embeddings into Boolean lattices
• scientific article; zbMATH DE number 1023179 (Why is no real title available?)

This page was built for publication: Embeddings on a Boolean cube

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