Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Andersen, R.: Finding large and small dense subgraphs. CoRR, abs/cs/0702032 (2007)
2. Lecture Notes in Computer Science;R. Andersen,2009
3. Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121(1-3), 15–26 (2002)
4. Lecture Notes in Computer Science;Y. Asahiro,1996
5. Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM 2008, pp. 95–106 (2008)
Cited by
161 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献