Log In Sign Up

Finding temporal patterns using algebraic fingerprints

by   Suhas Thejaswi, et al.

In this paper we study a family of pattern-detection problems in vertex-colored temporal graphs. In particular, given a vertex-colored temporal graph and a multi-set of colors as a query, we search for temporal paths in the graph that contain the colors specified in the query. These types of problems have several interesting applications, for example, recommending tours for tourists, or searching for abnormal behavior in a network of financial transactions. For the family of pattern-detection problems we define, we establish complexity results and design an algebraic-algorithmic framework based on constrained multilinear sieving. We demonstrate that our solution can scale to massive graphs with up to hundred million edges, despite the problems being NP-hard. Our implementation, which is publicly available, exhibits practical edge-linear scalability and highly optimized. For example, in a real-world graph dataset with more than six million edges and a multi-set query with ten colors, we can extract an optimal solution in less than eight minutes on a haswell desktop with four cores.


page 1

page 2

page 3

page 4


Restless reachability problems in temporal graphs

We study a family of reachability problems under waiting-time restrictio...

Finding Colorful Paths in Temporal Graphs

The problem of finding paths in temporal graphs has been recently consid...

Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors

Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (ST...

Finding Balance-Fair Short Paths in Graphs

The computation of short paths in graphs with edge lengths is a pillar o...

Finding Optimal Solutions With Neighborly Help

Can we efficiently compute optimal solutions to instances of a hard prob...

Behavior Query Discovery in System-Generated Temporal Graphs

Computer system monitoring generates huge amounts of logs that record th...

Coloring Mixed and Directional Interval Graphs

A mixed graph has a set of vertices, a set of undirected egdes, and a se...