A local algorithm for finding dense subgraphs

Reid Andersen. A local algorithm for finding dense subgraphs. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 1003-1009, SIAM, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.