Author:
Díaz J.,Serna M. J.,Torán J.
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. R.J. Anderson and E.W. Mayr. Approximating P-complete problems. Technical report, Stanford University, 1986.
2. B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. In 24 IEEE Symposium on Foundations of Computer Science, pages 265–273, 1983.
3. M. Chrobak and J. Naor. An efficient parallel algorithm for computing large independent set in a planar graph. In SPAA-89, pages 379–387. Association for Computing Machinery, 1989.
4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
5. T. Hagerup. Planar depth-first search in log n parallel time. SIAM Journal on Computing, 19:678–703, 1990.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献