Querying relational event graphs using colored range searching data structures
We present a general approach for analyzing structural parameters of a relational event graph within arbitrary query time intervals using colored range query data structures. Relational event graphs generally represent social network datasets, where each graph edge carries a timestamp. We provide data structures based on colored range searching to efficiently compute several graph parameters (e.g., density, neighborhood overlap, h-index).
|Colored range searching, Relational event graph, Social network analysis, Timestamp|
|Discrete Applied Mathematics|
|Organisation||Computational Geometry Lab|
Chanchary, F. (Farah), Maheshwari, A, & Smid, M. (2019). Querying relational event graphs using colored range searching data structures. Discrete Applied Mathematics. doi:10.1016/j.dam.2019.03.006