Bo Wu, Haiying Shen. Discovering the Densest Subgraph in MapReduce for Assortative Big Natural Graphs. In 24th International Conference on Computer Communication and Networks, ICCCN 2015, Las Vegas, NV, USA, August 3-6, 2015. pages 1-6, IEEE, 2015. [doi]
@inproceedings{WuS15-10,
title = {Discovering the Densest Subgraph in MapReduce for Assortative Big Natural Graphs},
author = {Bo Wu and Haiying Shen},
year = {2015},
doi = {10.1109/ICCCN.2015.7288397},
url = {http://dx.doi.org/10.1109/ICCCN.2015.7288397},
researchr = {https://researchr.org/publication/WuS15-10},
cites = {0},
citedby = {0},
pages = {1-6},
booktitle = {24th International Conference on Computer Communication and Networks, ICCCN 2015, Las Vegas, NV, USA, August 3-6, 2015},
publisher = {IEEE},
isbn = {978-1-4799-9964-4},
}