The complexity of congestion-1 embedding in a hypercube
From MaRDI portal
Publication:3361890
DOI10.1016/0196-6774(91)90004-IzbMath0734.68052OpenAlexW1984556896MaRDI QIDQ3361890
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items (5)
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. ⋮ Unnamed Item ⋮ Embedding multidimensional grids into optimal hypercubes ⋮ Separator-based graph embedding into multidimensional grids with small edge-congestion ⋮ An optimal embedding of cycles into incomplete hypercubes
This page was built for publication: The complexity of congestion-1 embedding in a hypercube
