Author:
Ernvall Jarmo,Katajainen Jyrki,Penttonen Martti
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference5 articles.
1. J. Ernvall,On the construction of spanning paths by Gray-code in compression of files, RAIRO Informatique, to appear.
2. J. Ernvall and O. Nevalainen,Compact storage schemes for formatted files by spanning trees, BIT 19 (1979), 464–475.
3. M. R. Garey, R. L. Graham and D. S. Johnson,Some NP-complete problems, Proc. 8th ACM Symposium on Theory of Computing (1976), 10–29.
4. M. R. Garey and D. S. Johnson,Computers and Intractability, Freeman, 1979.
5. C. H. Papadimitriou,The Euclidean traveling salesman problem is NP-complete, Theoretical Computer Science 4 (1977), 237–244.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献