Discovering the Densest Subgraph in MapReduce for Assortative Big Natural Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Bo Wu' in GoogleThis author has not been identified. Look up 'Haiying Shen' in Google

runs on WebDSL