Fixed hypercube embedding

DOI10.1016/0020-0190(87)90090-1zbMath0653.68074OpenAlexW1968082675MaRDI QIDQ1108043

David W. Krumme, K. N. Venkataraman, George Cybenko

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90090-1

zbMATH Keywords

hypercubeNP-completegraph embedding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Theory of software (68N99)

Related Items (6)

Multidimensional binary partitions: distributed data structures for spatial partitioning ⋮ Cover-preserving embeddings of bipartite orders into Boolean lattices ⋮ Hypercube embedding heuristics: An evaluation ⋮ Packing the hypercube ⋮ Cover-preserving order embeddings into Boolean lattices ⋮ On the complexity of the embedding problem for hypercube related graphs

Cites Work

• On the complexity of testing a graph for n-cube
• Distance-preserving subgraphs of hypercubes
• On Some Variants of the Bandwidth Minimization Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed hypercube embedding