Author:
Díaz J.,Serna M. J.,Torán J.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference24 articles.
1. Abrahamson, K., Dadoun, N., Kirkpatrick, D., Przytycka, K.: A simple parallel tree contraction algorithm. J. Algorithms, 10, 287–302 (1989)
2. Anderson, R.J., Mayr, E.W.: Approximating P-complete problems. Technical report, Stanford University, 1986.
3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: 24th Ann. IEEE Symp. on Foundations of Computer Science, pp. 265–273, 1983
4. Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153–180 (1994)
5. Bui, T.N., Peck, A.: Partitioning planar graphs. SIAM J. Comput. 21, 203–215 (1992)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献