15 citations · 20 across the 5 of their papers we have counts for
5 papers · 1 filter
Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs
Jiaxi Pu, Yanhao Wang, Yuchen Li +1
Temporal bipartite graphs are widely used to denote time-evolving relationships between two disjoint sets of nodes, such as customer-product interactions in E-commerce and user-gro…
Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
Jingjing Wang, Yanhao Wang, Wenjun Jiang +2
A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of…
Graph Summarization via Node Grouping: A Spectral Algorithm
Arpit Merchant, Michael Mathioudakis, Yanhao Wang
Graph summarization via node grouping is a popular method to build concise graph representations by grouping nodes from the original graph into supernodes and encoding edges into s…
Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)
Jingjing Wang, Yanhao Wang, Wenjun Jiang +2
A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of…
Semantic and Influence aware k-Representative Queries over Social Streams
Yanhao Wang, Yuchen Li, Kian-Lee Tan
Massive volumes of data continuously generated on social platforms have become an important information source for users. A primary method to obtain fresh and valuable information…