Article PDF
Avoid common mistakes on your manuscript.
References
R.P. Tewarson, Sparse Matrices, Academic Press, New York, 1973.
O.C. Zienkiewicz, The Finite Element Method in Engineering Science, McGraw-Hill, London, 1971.
N.E. Gibbs, W.G. Poole, Jr. and P.K. Stockmeyer, An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix,SIAM J. Numer. Anal.,13 (1976), 235–251.
G.C. Everstine, A Comparison of Three Resequencing Algorithm for the Reduction of Matrix Profile and Wave-Front.Internat. J. Number. Methods in Enge.,14 (1979), 837–863.
P.Z. Chinn, J. Chvatalova, A.K. Dewdney, N.E. Gibbs, The Bandwidth Problem for Graphs and Matrices—a Survey,J. Graph Theory,6 (1982), 223–254.
F.R.K. Chung, Labelling of Graphs, in: Selected Topics in Graph Theory, Vol. 3 (L.W. Beineke and R.J. Wilson, Eds), 1988, 151–168.
L. Lovasz, Perfect Graphs, in: Selected Topics in Graph Theory, Vol. 2 (L.W. Beineke and R.J. Wilson, Eds), 1983, 55–88.
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, New York, 1976.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
Author information
Authors and Affiliations
Additional information
This project is supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Lin, Y., Yuan, J. Profile minimization problem for matrices and graphs. Acta Mathematicae Applicatae Sinica 10, 107–112 (1994). https://doi.org/10.1007/BF02006264
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02006264