Querying Relational Event Graphs Using Colored Range Searching Data Structures

DOI10.1007/978-3-319-53007-9_8zbMath1453.68128OpenAlexW2585565117MaRDI QIDQ2971637

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

Publication date: 7 April 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_8

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

The Most Likely Object to be Seen Through a Window, Time Windowed Data Structures for Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Influence diffusion in social networks under time window constraints
• Counting Subgraphs in Relational Event Graphs
• Priority Search Trees
• Arboricity and Subgraph Listing Algorithms
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS