Author:
Bovet D. P.,Clementi A.,Crescenzi P.,Silvestri R.
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. N. Alon, L. Babai, and A. Itai (1986), “A fast and simple randomized parallel algorithm for the maximal independent set problem”, J. Algorithms 7, 567–583.
2. R. Anderson, and E.W. Mayr (1984), “A P-complete problem and approximation to it”, Technical Report STAN-CS-84-1014, Department of Computer Science, Stanford University.
3. A. Andreev, A. Clementi, P. Crescenzi, E. Dahlhaus, S. De Agostino, and J.D.P. Rolim (1995), “The parallel complexity of approximating the high degree subgraph problem”, Proc. 6th Annual International Symposium on Algorithms and Computation, to appear.
4. B.S. Baker (1994), “Approximation algorithms for NP-complete problems on planar graphs”, J. ACM 41, 153–180.
5. B. Berger, and J. Rompel (1989), “Simulating (logc n)-wise independence in NC”, Proc. 30th FOCS, 2–7.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献