85 citations · 219 across the 14 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.SI2022
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…
cs.DS2022
Balancing Utility and Fairness in Submodular Maximization (Technical Report)
Yanhao Wang, Yuchen Li, Francesco Bonchi +1
Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recomm…