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]
@inproceedings{Andersen08:0,
title = {A local algorithm for finding dense subgraphs},
author = {Reid Andersen},
year = {2008},
doi = {10.1145/1347082.1347192},
url = {http://doi.acm.org/10.1145/1347082.1347192},
researchr = {https://researchr.org/publication/Andersen08%3A0},
cites = {0},
citedby = {0},
pages = {1003-1009},
booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008},
editor = {Shang-Hua Teng},
publisher = {SIAM},
}