Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams

MLA

Wang, Jingjing, et al. Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams. 2022. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1381584361&authtype=sso&custid=ns315887.

APA

Wang, J., Wang, Y., Jiang, W., Li, Y., & Tan, K.-L. (2022). Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams.

Chicago

Wang, Jingjing, Yanhao Wang, Wenjun Jiang, Yuchen Li, and Kian-Lee Tan. 2022. “Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsoai&AN=edsoai.on1381584361&authtype=sso&custid=ns315887.