Author:
Backer Jonathan,Keil J. Mark
Funder
Natural Sciences and Engineering Research Council of Canada
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference11 articles.
1. Clustering and domination in perfect graphs;Corneil;Discrete Appl. Math.,1984
2. U. Feige, M. Seltser, On the densest k-subgraph problem, Technical Report, The Weizmann Institute, 1997
3. The complexity of clustering in planar graphs;Keil;J. Combin. Math. Combin. Comput.,1991
4. Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique;Khot;SIAM J. Comput.,2006
5. A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, A. Vijayaraghavan, Detecting high log-densities — an o(n1/4) approximation for densest k-subgraph, in: ACM Symposium on Theory of Computing, 2010, in press
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献