The congestion of n-cube layout on a rectangular grid

@article{Bezrukov2000TheCO,
  title={The congestion of n-cube layout on a rectangular grid},
  author={Sergei L. Bezrukov and Joe D. Chavez and L. H. Harper and Markus R{\"o}ttger and Ulf-Peter Schroeder},
  journal={Discrete Mathematics},
  year={2000},
  volume={213},
  pages={13-19}
}
We consider the problem of embedding the n-dimensional cube into a rectangular grid with 2n vertices in such a way as to minimize the congestion, the maximum number of edges along any point of the grid. After presenting a short solution for the cutwidth problem of the n-cube (in which the n-cube is embedded into a path), we show how to extend the results to give an exact solution for the congestion problem. 

From This Paper

Figures, tables, and topics from this paper.
44 Citations
4 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Labelings of Graphs, Graph Theory 3, Academic Press, 1988. 6 r r r r r r r r 1a 2a 2b 1b

  • F.R.K. Chung
  • 1988
1 Excerpt

Optimal assignments of numbers to vertices

  • L. H. Harper
  • J. Society Industrial and Applied Mathematics
  • 1964
2 Excerpts

Similar Papers

Loading similar papers…