Optimal linear arrangement of a rectangular grid

Discrete Mathematics

Volumn 213, Issue 1-3, 2000, Pages 123-139

  Fishburn, Peter ^a   Tetali, Prasad ^b   Winkler, Peter ^c  

^a AT AND T LABS RESEARCH   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042782992     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00173-9     Document Type: Article

References (8)

1. S. Bezrukov, Edge isoperimetric problems on graphs, preprint, 1996.
2. J.D. Chavez, L.H. Harper, Discrete isoperimetric problems and pathmorphisms, preprint, 1996.
3. J. Chvátalová, Optimal labeling of a product of two paths, Discrete. Math. 2 (1975) 249-253.
4. G. Mitchison, R. Durbin, Optimal numberings of an n × n array, SIAM J. Algebra Discrete Math. 7 (1986) 571-582.
5. D.O. Muradjan, T.E. Piliposjan, Minimal numberings of vertices of a rectangular lattice, Akad. Nauk. Armjan. SSR. Dokl. 70 (1980) 21-27 (see MR 81m:05121) (in Russian).
6. D.O. Muradjan, Minimal numberings of a two-dimensional cylinder, Akad. Nauk. Armjan. SSR. Dokl. 75 (1982) 114-119 (see MR 84m:05041) (in Russian).
7. D.O. Muradjan, Some estimates for the length of an arbitrary graph, Mat. Voprosy Kibernet. Vychisl. Tekhn. (1985) 79-86 (in Russian).
8. Y. Rinott, Multivariate majorization and rearrangement inequalities with some applications to probability and statistics, Israel J. Math. 15 (1973) 60-77.