10 citations · 18 across the 6 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2019
Retrieving Top Weighted Triangles in Graphs
Raunak Kumar, Paul Liu, Moses Charikar +1
Pattern counting in graphs is a fundamental primitive for many network analysis tasks, and a number of methods have been developed for scaling subgraph counting to large graphs. Ma…
cs.SI2018★ 3 cited
A sampling framework for counting temporal motifs
Paul Liu, Austin Benson, Moses Charikar
Pattern counting in graphs is fundamental to network science tasks, and there are many scalable methods for approximating counts of small patterns, often called motifs, in large gr…