Author of the publication

Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model.

, , and . SC, page 91:1-91:12. ACM, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fast Parallel Algorithms for Counting and Listing Triangles in Big Graphs., , and . ACM Trans. Knowl. Discov. Data, 14 (1): 5:1-5:34 (2020)NAP: An Agent-Based Scheme on Reducing Churn-Induced Delays for P2P Live Streaming., , and . Peer-to-Peer Computing, page 1-10. IEEE, (2010)A Space-Efficient Parallel Algorithm for Counting Exact Triangles in Massive Networks., , and . HPCC/CSS/ICESS, page 527-534. IEEE, (2015)k-nearest Neighbor Classification on Spatial Data Streams Using P-trees., , and . PAKDD, volume 2336 of Lecture Notes in Computer Science, page 517-518. Springer, (2002)A Study of Information Diffusion over a Realistic Social Network Model., , , , , , and . CSE (4), page 675-682. IEEE Computer Society, (2009)A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model, , , and . CoRR, (2012)Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming., , , and . ICPP, page 594-603. IEEE Computer Society, (2010)Abstract: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients., , and . SC Companion, page 1448-1449. IEEE Computer Society, (2012)Fast parallel conversion of edge list to adjacency list for large-scale graphs., and . SpringSim (HPS), page 17-24. SCS/ACM, (2015)PATRIC: a parallel algorithm for counting triangles in massive networks., , and . CIKM, page 529-538. ACM, (2013)