Bounding the bandwidths for graphs

Theoretical Computer Science

Volumn 249, Issue 2, 2000, Pages 357-368

  Zhou, Sanming ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Bandwidth; Cyclic bandwidth; VLSI layout

Indexed keywords

EID: 0141965615     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00068-2     Document Type: Article

References (15)

1. S.N. Bhatt, F.T. Leighton, A framework for solving VLSI graph layout problems, Comput. System Sci. 28 (1984) 300-343.
2. 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.
3. F.R.K. Chung, Labelings of graphs, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Vol. 3, Academic Press, San Diego, 1988, pp. 151-168.
4. V. Chvátal, A remark on a problem of Harary, Czechoslovak Math. J. 20 (1970) 109-111.
5. F. Harary, Problem 16, in: M. Fiedler (Ed.), Theory of Graphs and its Applications, Czechoslovak Academy of Science, Prague, 1967, p. 161.
6. F. Harary, Graph Theory, Addison-Wesley Publishing Company, Reading, MA, 1969.
7. L.H. Harper, Optimal numberings and isoperimeter problems on graphs, J. Combin. Theory 1 (1966) 385-393.
8. J. Hromkovic, V. Muller, O. Sykora, I. Vrto, On embedding interconnection networks into rings of processors, in: Lecture Notes in Computer Science, Vol. 605, Springer, Berlin, 1993, pp. 53-62.
9. Y.X. Lin, A level structure approach on the bandwidth problem for special graphs, Ann. New York Acad. Sci. 576 (1989) 344-357.
10. Y.X. Lin, The cyclic bandwidth problem, System Sci. Math. Sci. (English Edition) 7 (3) (1994) 282-288.
11. Y.X. Lin, Two dimensional bandwidth problem, in: Y. Alavi, D.R. Lick, J. Liu (Eds.), Combinatorics, Graph Theory, Algorithms and Applications, World Scientific Publishing, River Edge, NJ, 1994, pp. 223-232.
12. Y.X. Lin, Minimum bandwidth problem for embedding graphs in cycles, Networks 29 (1997) 135-140.
13. C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976) 263-270.
14. Sanming Zhou, Jinjiang Yuan, Harper-type lower bounds and the bandwidths of the compositions of graphs, Discrete Math. 181 (1998) 255-266.
15. Sanming Zhou, Interpolation theorems for graphs, hypergraphs and matroids, Discrete Math. 185 (1998) 221-229.