The complexity of congestion-1 embedding in a hypercube

DOI10.1016/0196-6774(91)90004-IMaRDI QIDQ3361890zbMATH OpenOpenAlexFDO

Authors Youngman Kim, Ten H. Lai

Publication date 1991

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(91)90004-i

zbMATH Keywords

hypercube

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1769334
• scientific article; zbMATH DE number 19194
• Congestion optimale du plongement de l’hypercube H (n) dans la chaîne P(2ⁿ)
• A tight bound for congestion of an embedding
• On the complexity of the embedding problem for hypercube related graphs

Cited in

(11)

• Fixed hypercube embedding
• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• An optimal embedding of cycles into incomplete hypercubes
• On the complexity of the embedding problem for hypercube related graphs
• The congestion of \(n\)-cube layout on a rectangular grid
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• The complexity of cubical graphs
• Congestion optimale du plongement de l’hypercube H (n) dans la chaîne P(2ⁿ)
• scientific article; zbMATH DE number 1769334 (Why is no real title available?)
• A tight bound for congestion of an embedding
• Embedding multidimensional grids into optimal hypercubes

This page was built for publication: The complexity of congestion-1 embedding in a hypercube

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