Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges

DOI10.1137/1.9781611973105.61zbMath1422.68100arXiv1209.5791OpenAlexW2951323238MaRDI QIDQ5741769

Michael J. Bannister, David Eppstein, Padhraic Smyth, Christopher Dubois

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.5791

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Data structures (68P05)

Related Items (5)

Using compressed suffix-arrays for a compact representation of temporal-graphs ⋮ Querying relational event graphs using colored range searching data structures ⋮ The Most Likely Object to be Seen Through a Window ⋮ Window queries for intersecting objects, maximal points and approximations using coresets ⋮ Time Windowed Data Structures for Graphs

This page was built for publication: Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges