Querying relational event graphs using colored range searching data structures
From MaRDI portal
Publication:2201770
DOI10.1016/J.DAM.2019.03.006zbMATH Open1453.68129OpenAlexW2942074353WikidataQ128206002 ScholiaQ128206002MaRDI QIDQ2201770FDOQ2201770
Farah Chanchary, Michiel Smid, Anil Maheshwari
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
Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Arboricity and Subgraph Listing Algorithms
- New upper bounds for generalized intersection searching problems
- Influence diffusion in social networks under time window constraints
- A greedy algorithm for neighborhood overlap-based community detection
- Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges
- Counting Subgraphs in Relational Event Graphs
Cited In (2)
Recommendations
- Querying Relational Event Graphs Using Colored Range Searching Data Structures 👍 👎
- Data structures on event graphs 👍 👎
- Data structures on event graphs 👍 👎
- Colored range queries and document retrieval 👍 👎
- Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges 👍 👎
- Containment of queries for graphs with data 👍 👎
This page was built for publication: Querying relational event graphs using colored range searching data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201770)
