Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges

Streaming graph analysis is gaining importance in various fields due to the natural dynamicity in many real graph applications. However, approximately counting triangles in real-world streaming graphs with duplicate edges and sliding window model ...

The triangle counting problem in graph streams has been extensively studied in social network analysis, recommendation systems, user portraits and other fields. However, cloud computing based streaming algorithms cause high bandwidth occupation ...

• A framework of edge–cloud triangle counting to count triangles in graph streams.
• Algorithms TbEC and TbECOPT to reduce the transmission cost between the edge and cloud.
• Algorithms TbEC-BF and TbECOPT-BF to accurately count ...

Suppose G is a graph with n vertices and m edges. Let n^' be the maximum number of vertices in an induced bipartite subgraph of G and let m^' be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G)=m^'/m is called the bipartite ...