Redmond, UrsulaUrsulaRedmondCunningham, PádraigPádraigCunningham2016-04-062016-04-062013 ACM2013-08-28http://hdl.handle.net/10197/75472013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Ontario, Canada, 25-28 August 2013Temporal 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.en© 2013 ACM. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in http://dx.doi.org/10.1145/2492517.2492586.Subgraph isomorphism problemTemporal informationPeer-to-peer lendingConference Publication10.1145/2492517.24925862014-10-15https://creativecommons.org/licenses/by-nc-nd/3.0/ie/