On Relaxed Squashed Embedding of Graphs into a Hypercube

DOI10.1137/0218081MaRDI QIDQ3211328zbMATH OpenOpenAlexFDO

Authors Ming-Syan Chen, Kang G. Shin

Publication date 1989

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/94e1bde7de0f0e342b2967e6df1db6cf7488f02d

zbMATH Keywords

heuristic searchinteracting modulesloop switching addressing schemen-cubesearch algorithmsquashed embeddingTask allocationweak cubical dimension of a graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Stone spaces (Boolean spaces) and related structures (06E15) Embeddings in algebraic geometry (14E25)

Recommendations

• scientific article; zbMATH DE number 19194
• Multiple network embeddings into hypercubes
• Hypercube embedding heuristics: An evaluation
• Embedding of Grids into Optimal Hypercubes
• scientific article; zbMATH DE number 140144

Cited in

(3)

• Cover-preserving order embeddings into Boolean lattices
• Hypersphere mapper: A nonlinear programming approach to the hybercube embedding problem
• scientific article; zbMATH DE number 3917694 (Why is no real title available?)

This page was built for publication: On Relaxed Squashed Embedding of Graphs into a Hypercube

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