2 papers
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.SI2020
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…