3 papers
cs.DB2026
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
Linglin Yang, Xunbin Su, Lei Zou +2
Subgraph matching is a fundamental problem in graph analysis with a wide range of applications. However, due to its inherent NP-hardness, enumerating subgraph matches efficiently o…
cs.DS2019
Dolha - an Efficient and Exact Data Structure for Streaming Graphs
Fan Zhang, Lei Zou, Li Zeng +1
A streaming graph is a graph formed by a sequence of incoming edges with time stamps. Unlike static graphs, the streaming graph is highly dynamic and time related. In the real worl…
cs.DS2018
Fast and Accurate Graph Stream Summarization
Xiangyang Gou, Lei Zou, Chenxingyu Zhao +1
A graph stream is a continuous sequence of data items, in which each item indicates an edge, including its two endpoints and edge weight. It forms a dynamic graph that changes with…