CTGPM

This repository contains the code used in our paper: Towards Efficient Simulation-based Constrained Temporal Graph Pattern Matching.

Requirements

• cmake
• g++ (supports c++17)
• JGraphT

Datasets

Each dataset can be obtained from the following links.

Datasets	link
Highschool	http://www.sociopatterns.org/datasets/high-school-contact-and-friendship-networks
Mathoverflow	https://snap.stanford.edu/data/sx-mathoverflow.html
Superuser	https://snap.stanford.edu/data/sx-superuser.html
Wikitalk	https://snap.stanford.edu/data/wiki-talk-temporal.html
Syngraph	generated by JGraphT based on the ER model

All data in experiments is available at Google Drive.

Compared algorithms

Algorithm	Paper
Timing	Time Constrained Continuous Subgraph Search over Streaming Graphs
OPMA$^+$	Time-respecting Flow Graph Pattern Matching on Temporal Graphs
WTmatch
BCTmatch, DTmatch-R, DTmatch

Usage

1. Download the whole data from Google Drive or generate by yourself with the code in PRE and the datasets from above link.
2. Put the data in the corresponding code folder.
3. Use CMakeLists.txt to compile.
4. Run the corresponding file.