Querying relational event graphs using colored range searching data structures
From MaRDI portal
Publication:2201770
Recommendations
Cites work
- A greedy algorithm for neighborhood overlap-based community detection
- Arboricity and Subgraph Listing Algorithms
- Counting subgraphs in relational event graphs
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Influence diffusion in social networks under time window constraints
- Networks, crowds and markets. Reasoning about a highly connected world.
- New upper bounds for generalized intersection searching problems
- Windows into relational events: data structures for contiguous subsequences of edges
Cited in
(5)- Window queries for intersecting objects, maximal points and approximations using coresets
- Time windowed data structures for graphs
- Counting subgraphs in relational event graphs
- Windows into relational events: data structures for contiguous subsequences of edges
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
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)