Minimum bandwidth problem for embedding graphs in cycles

Networks

Volumn 29, Issue 3, 1997, Pages 135-140

  Lin, Yixun ^a  

^a ZHENGZHOU UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039918021     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199705)29:3<135::AID-NET1>3.0.CO;2-I     Document Type: Article

References (8)

1. S. N. Bhatt and F. T. Leighton, A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2) (1984) 300-343.
2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. American Elsevier, New York, 1976.
3. P. Z. Chinn, J. Chvatalova, A. K. Dewdney, and 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. Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson, Eds.) Academic Press Limited, London 3 (1988) 151-168.
5. L. H. Harper, Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory 1 (1966) 358-393.
6. J. Hromkovic, V. Muller, O. Sykora, and I. Vrto, On embedding interconnection networks into rings of processors. Lecture Notes in Computer Science 605. Springer-Verlag, Berlin (1993) 53-62.
7. Y. Lin, Bandwidth and cyclic bandwidth. J. Syst. Sci. Syst. Eng. 5(3) (1996) 296-302.
8. B. Monien and H. Sudborough, Embedding one interconnection network in another. Computing (Suppl.) 7 (1990) 257-282.