Finding Path Motifs in Large Temporal Graphs Using Algebraic Fingerprints

Suhas Thejaswi
Suhas Thejaswi

Big Data, pp. 335-362, 2020.

Cited by: 0|Bibtex|Views13|DOI:https://doi.org/10.1089/big.2020.0078
WOS EI
Other Links: pubmed.ncbi.nlm.nih.gov|dblp.uni-trier.de|academic.microsoft.com

Abstract:

We study a family of pattern-detection problems in vertex-colored temporal graphs. In particular, given a vertex-colored temporal graph and a multiset 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 applications, for example, in recommendi...More

Code:

Data:

Your rating :
0

 

Tags
Comments