A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism

TL;DR

This paper introduces a new algorithm for temporal subgraph isomorphism that directly matches edges in chronological order, significantly improving performance over previous static-based methods and providing more meaningful results in temporal networks.

Contribution

The paper proposes a novel edge-driven algorithm that performs direct temporal subgraph matching, enhancing efficiency and accuracy in analyzing temporal networks.

Findings

Significant performance improvements demonstrated on real datasets.

Effective in matching complex temporal motifs with four or more nodes.

Produces more meaningful results than static subgraph searches.

Abstract

Many real world networks are considered temporal networks, in which the chronological ordering of the edges has importance to the meaning of the data. Performing temporal subgraph matching on such graphs requires the edges in the subgraphs to match the order of the temporal graph motif we are searching for. Previous methods for solving this rely on the use of static subgraph matching to find potential matches first, before filtering them based on edge order to find the true temporal matches. We present a new algorithm for temporal subgraph isomorphism that performs the subgraph matching directly on the chronologically sorted edges. By restricting our search to only the subgraphs with chronologically correct edges, we can improve the performance of the algorithm significantly. We present experimental timing results to show significant performance improvements on publicly available datasets for a number of different temporal query graph motifs with four or more nodes. We also demonstrate a practical example of how temporal subgraph isomorphism can produce more meaningful results than traditional static subgraph searches.