Querying relational event graphs using colored range searching data structures

DOI10.1016/j.dam.2019.03.006zbMath1453.68129OpenAlexW2942074353WikidataQ128206002 ScholiaQ128206002MaRDI QIDQ2201770

Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid

Publication date: 17 September 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.006

zbMATH Keywords

social network analysistimestampcolored range searchingrelational event graph

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (1)

Window queries for intersecting objects, maximal points and approximations using coresets

Cites Work

• A greedy algorithm for neighborhood overlap-based community detection
• Influence diffusion in social networks under time window constraints
• Counting Subgraphs in Relational Event Graphs
• Arboricity and Subgraph Listing Algorithms
• New upper bounds for generalized intersection searching problems
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges
• Unnamed Item

This page was built for publication: Querying relational event graphs using colored range searching data structures