TRIANGLES COUNTING METHOD FOR GRAPH STREAM

摘要

A triangle counting method for a graph stream includes receiving a graph stream for a plurality of graphs from a computer device, wherein the computer device stores in the buffer any one edge received in the graph stream, Sampling the trunk stored in the buffer if it already exists, computing the triangle count value for the neighboring vertices, determining the at least one common neighbor vertex for the trunk, And updating the counting value using the weighted average calculated based on the last full time of the buffer and the previously counted value.