3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 3 cited
FURL: Fixed-memory and Uncertainty Reducing Local Triangle Counting for Graph Streams
Minsoo Jung, Sunmin Lee, Yongsub Lim +1
How can we accurately estimate local triangles for all nodes in simple and multigraph streams? Local triangle counting in a graph stream is one of the most fundamental tasks in gra…
cs.SI2014
VoG: Summarizing and Understanding Large Graphs
Danai Koutra, U Kang, Jilles Vreeken +1
How can we succinctly describe a million-node graph with a few simple sentences? How can we measure the "importance" of a set of discovered subgraphs in a large graph? These are ex…