Embeddings on a Boolean cube

DOI10.1007/BF02017346zbMATH Open0696.68024MaRDI QIDQ911244FDOQ911244

Authors: N. E. Zubov 

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

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

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)

Cites Work

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

Cited In (5)

• Cover-preserving order embeddings into Boolean lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ordering the Boolean cube vectors by their weights and with minimal change
• Realization of Boolean functions by combinational circuits embedded in the hypercube

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)