Embeddings on a Boolean cube

DOI10.1007/BF02017346zbMath0696.68024MaRDI QIDQ911244

N. E. Zubov

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

embeddinggraphsinterconnection 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)

Related Items (1)

Cover-preserving order embeddings into Boolean lattices

Cites Work

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

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