Analysis of the structural properties of social networks has gained much interest nowadays due to its diverse range of applications. When communications between entities (i.e., edges) of a social network (graph) are stamped with time, we want to analyze all subgraphs within an arbitrary query time slice so that the number of a specific subgraph can be counted and reported quickly. We present data structures to answer such queries for triangles, quadrangles, complete subgraphs, and maximal complete subgraphs.

Additional Metadata
Keywords Dominance counting, Relational event graph, Subgraph counting, Timestamp
Persistent URL dx.doi.org/10.1007/978-3-319-30139-6_16
Citation
Chanchary, F. (Farah), & Maheshwari, A. (2016). Counting subgraphs in relational event graphs. doi:10.1007/978-3-319-30139-6_16