Two models of two-dimensional bandwidth problems

Information Processing Letters

Volumn 110, Issue 11, 2010, Pages 469-473

  Lin, Lan ^a,b   Lin, Yixun ^c  

^a Ministry of Education   (China)

^b TONGJI UNIVERSITY   (China)

^c ZHENGZHOU UNIVERSITY   (China)

Author keywords

Graph algorithms; Lower bound; Optimal embedding; Two dimensional bandwidth; Upper bound

Indexed keywords

BANDWIDTH;

GRAPH ALGORITHMS; LOWER BOUNDS; OPTIMAL EMBEDDING; TWO-DIMENSIONAL BANDWIDTHS; UPPER BOUND;

GRAPH THEORY;

EID: 80052924652     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.04.013     Document Type: Article

References (12)

1. S.N. Bhatt, F.T. Leighton, A framework for solving VLSI graph layout problem, J. Computer and System Sciences 28 (2) (1984) 300-343.
2. S.N. Bhatt, S. Cosmadakis, The complexity of minimizing wire lengths in VLSI layouts, Information Processing Letters 25 (1987) 263-267. (Pubitemid 17641505)
3. P.Z. Chinn, J. Chvátalová, A.K. Dewdney, N.E. Gibbs, The bandwidth problem for graphs and matrices - A survey, J. Graph Theory 6 (1982) 223-254.
4. F.R.K. Chung, Labelings of graphs, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, vol. 3, 1988, pp. 151-168.
5. J. Diaz, J. Petit, M. Serna, A survey of graph layout problems, ACM Computing Surveys 34 (2002) 313-356.
6. Y.L. Lai, K. Williams, A survey of solved problems and applications on bandwith, edgesum, and profile of graphs, J. Graph Theory 31 (1999) 75-94. (Pubitemid 129563564)
7. Y. Lin, Two-dimensional bandwidth problem, in: Y. Alavi, et al. (Eds.), Combinatorics, Graph Theory, Algorithms and Applications, World Scientific, 1994, pp. 223-232.
8. Y. Lin, On density lower bounds of two-dimensional bandwidth, J. Mathematical Research and Exposition 16 (3) (1996) 343-349.
9. Y. Lin, J. Hao, X. Li, Two-dimensional bandwidth problem under distance of L∞-norm, OR Transactions 4 (3) (2000) 8-12.
10. J. Opatrny, D. Sotteau, Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1, Discrete Applied Math. 98 (2000) 237-254.
11. M.M. Syslo, J. Zak, The bandwidth problem: Critical subgraphs and the solution for caterpillars, Annals of Discrete Math. 16 (1982) 281-286.
12. C.H. Yeh, B. Parhami, VLSI layouts of complete graphs and star graphs, Information Processing Letters 68 (1998) 39-45. (Pubitemid 128379418)