Author:
Rosenberg A. L.,Sudborough I. H.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference22 articles.
1. Aykuz, F. A., Tuku, S.: An automatic node-relabelling scheme for bandwidth minimization of stiffness matrices. Amer. Inst. of Aero. and Astro. J.6, 728–730 (1968).
2. Chen, K. Y.: Minimizing the bandwidth of sparse symmetric matrices. Computing11, 27–30 (1973).
3. Cook, S. A.: An observation on time-space tradeoffs. J. Comp. Syst. Sci.9, 308–316 (1974).
4. Garey, M. R., Graham, R. L., Johnson, D. S., Knuth, D. E.: Complexity results for bandwidth minimization. SIAM J. Appl. Math.34, 477–495 (1978).
5. Gilbert, J. R., Lengauer, T., Tarjan, R. E.: The pebbling problem is complete in polynomial space. SIAM J. Comput.9, 513–524 (1980).
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献