Can I read Evolving Subgraph Matching on Temporal Graphs on EtoBox?

Evolving Subgraph Matching on Temporal Graphs by Faming Li; Zhaonian Zou; Jianzhong Li; Xiaochun Yang; Bin Wang is a Computer Science article available to read on EtoBox.

What is Evolving Subgraph Matching on Temporal Graphs about?

Given a set of query graphs and specified orders between these query graphs, the evolving subgraph matching problem finds all subgraph sets from the temporal graph that not only match the given query graph set but also satisfy the specified orders. This problem motivates many significant application, e.g., social network analysis, financial fraud crimes detection, biological information mining, and so on. To efficiently address this problem, an evolving subgraph matching algorithm based on two key techniques is proposed. First, a memory-efficient index structure called EMI is designed to compactly store all necessary information required for finding all evolving matchings. To make the EMI compact and to construct the EMI efficiently, several techniques, such as four well-designed filters and adaptive filling orders, are proposed. Second, an evolving subgraph matching enumeration method is designed to immediately run on the EMI instead of on the temporal graph. The enumeration method expands evolving matchings in an edge-by-edge manner. Since the EMI is compactly maintained in the main memory and generally smaller than the temporal graph, the enumeration method runs very fast on the

Who reads Evolving Subgraph Matching on Temporal Graphs?

Author

Faming Li; Zhaonian Zou; Jianzhong Li; Xiaochun Yang; Bin Wang

Publisher

Elsevier BV

Published

2022

Language

EN

Field

Computer Science (Physical Sciences)