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).
CITATION STYLE
Chanchary, F., Maheshwari, A., & Smid, M. (2017). Querying relational event graphs using colored range searching data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10156 LNCS, pp. 83–95). Springer Verlag. https://doi.org/10.1007/978-3-319-53007-9_8
Mendeley helps you to discover research relevant for your work.