Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage.
Pinghui WangYiyan QiYu SunXiangliang ZhangJing TaoXiaohong GuanPublished in: Proc. VLDB Endow. (2017)
Keyphrases
- memory usage
- weighted graph
- undirected graph
- memory requirements
- graph structure
- memory footprint
- data streams
- edge weights
- graph theory
- directed graph
- random walk
- structured data
- disjoint paths
- edge detection
- vertex set
- connected components
- bipartite graph
- graph representation
- graph model
- graph theoretic
- edge detector
- strongly connected
- bayesian networks
- real time
- massive graphs
- transactional data
- directed acyclic graph
- query optimization
- sliding window
- shortest path
- image processing