A local algorithm for finding dense subgraphs

Reid Andersen. A local algorithm for finding dense subgraphs. ACM Transactions on Algorithms, 6(4), 2010. [doi]

@article{Andersen10,
  title = {A local algorithm for finding dense subgraphs},
  author = {Reid Andersen},
  year = {2010},
  doi = {10.1145/1824777.1824780},
  url = {http://doi.acm.org/10.1145/1824777.1824780},
  researchr = {https://researchr.org/publication/Andersen10},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {6},
  number = {4},
}