Time Windowed Data Structures for Graphs

DOI10.7155/jgaa.00489zbMath1407.05219OpenAlexW2915958493MaRDI QIDQ3121517

Anil Maheshwari, Farah Chanchary

Publication date: 18 March 2019

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00489

zbMATH Keywords

time-windowed queriestime-windowed reporting problems

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items

The Most Likely Object to be Seen Through a Window ⋮ Window queries for intersecting objects, maximal points and approximations using coresets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• Finding and counting given length cycles
• Fractional cascading. I: A data structuring technique
• A greedy algorithm for neighborhood overlap-based community detection
• A data structure for dynamic trees
• Window queries for problems on intersecting objects and maximal points
• Querying Relational Event Graphs Using Colored Range Searching Data Structures
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation
• Priority Search Trees
• Arboricity and Subgraph Listing Algorithms
• The Complexity of Enumeration and Reliability Problems
• An Algorithm for Subgraph Isomorphism
• Finding a Minimum Circuit in a Graph
• Matrix measures for transitivity and balance*
• The Structure and Function of Complex Networks
• New upper bounds for generalized intersection searching problems
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Collective dynamics of ‘small-world’ networks
• Finding All Maximal Subsequences with Hereditary Properties
• Orthogonal range searching on the RAM, revisited
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Algorithms and Computation
• Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges