MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs (Extended Abstract) - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Pinghui Wang, Junzhou Zhao, Xiangliang Zhang, Zhenguo Li, Jiefeng Cheng, John C. S. Lui, Don Towsley, Xiaohong Guan. MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs (Extended Abstract). In 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16-19, 2018. pages 1773-1774, IEEE Computer Society, 2018. [doi]

This author has not been identified. Look up 'Pinghui Wang' in GoogleThis author has not been identified. Look up 'Junzhou Zhao' in GoogleThis author has not been identified. Look up 'Xiangliang Zhang' in GoogleThis author has not been identified. Look up 'Zhenguo Li' in GoogleThis author has not been identified. Look up 'Jiefeng Cheng' in GoogleThis author has not been identified. Look up 'John C. S. Lui' in GoogleThis author has not been identified. Look up 'Don Towsley' in GoogleThis author has not been identified. Look up 'Xiaohong Guan' in Google

runs on WebDSL