Temporal subgraph isomorphism

Abstract

Abstract-Temporal information is increasingly available with network data sets. This information can expose underlying processes in the data via sequences of link activations. Examples range from the propagation of ideas through a scientific collaboration network, to the spread of disease via contacts between infected and susceptible individuals. We focus on the flow of funds through an online financial transaction network, in which given patterns might signify suspicious behaviour. The search for these patterns may be formulated as a temporally constrained subgraph isomorphism problem. We compare two algorithms which use temporal data at different stages during the search, and empirically demonstrate one to be significantly more efficient.

Modern temporal network theory: a colloquium

“…[156]. Redmond and Cunningham [237] investigate the related algorithmic problem of counting and listing isomorphic temporal subgraphs.…”

A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism

“…Another closely related work is that of Redmond and Cunningham [14] [15]. Their definition of temporal subgraph isomorphism has some similarities to our own, but also has some distinct differences.…”

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants

“…More generally, we have experimental support for connecting the solver to an external constraint programming solver, to handle arbitrary side constraints (a bit like Satisfiability Modulo Theories). This could be useful, for example, for temporal graphs [21]; we would be interested in exploring this direction further to tackle suitable real-world applications. Another potential application area is inside graph rewriting systems [10].…”