Time windowed data structures for graphs

DOI10.7155/JGAA.00489MaRDI QIDQ3121517zbMATH OpenOpenAlexFDO

Authors Farah Chanchary, Anil Maheshwari

Publication date 18 March 2019

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

time-windowed queriestime-windowed reporting problems

Mathematics Subject Classification ID

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

Recommendations

• Windows into relational events: data structures for contiguous subsequences of edges
• Querying Relational Event Graphs Using Colored Range Searching Data Structures
• Querying relational event graphs using colored range searching data structures
• Counting subgraphs in relational event graphs
• Dynamic Graphs in the Sliding-Window Model

Cites work

• scientific article; zbMATH DE number 6876123 (Why is no real title available?)
• scientific article; zbMATH DE number 867627 (Why is no real title available?)
• A data structure for dynamic trees
• A greedy algorithm for neighborhood overlap-based community detection
• Algorithms and Computation
• An Algorithm for Subgraph Isomorphism
• Arboricity and Subgraph Listing Algorithms
• Collective dynamics of `small-world' networks
• Computational geometry. Algorithms and applications.
• Finding a Minimum Circuit in a Graph
• Finding all maximal subsequences with hereditary properties
• Finding and counting given length cycles
• Finding and counting small induced subgraphs efficiently
• Fractional cascading. I: A data structuring technique
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Matrix measures for transitivity and balance*
• Networks, crowds and markets. Reasoning about a highly connected world.
• New upper bounds for generalized intersection searching problems
• Orthogonal range searching on the RAM, revisited
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Priority Search Trees
• Querying Relational Event Graphs Using Colored Range Searching Data Structures
• Randomized fully dynamic graph algorithms with polylogarithmic time per operation
• The Complexity of Enumeration and Reliability Problems
• The Structure and Function of Complex Networks
• Two approaches to building time-windowed geometric data structures
• Window queries for problems on intersecting objects and maximal points
• Windows into relational events: data structures for contiguous subsequences of edges

Cited in

(8)

• Two approaches to building time-windowed geometric data structures
• Fast and Simple Connectivity in Graph Timelines
• Window queries for intersecting objects, maximal points and approximations using coresets
• Sliding window temporal graph coloring
• The Most Likely Object to be Seen Through a Window
• Counting subgraphs in relational event graphs
• Windows into relational events: data structures for contiguous subsequences of edges
• A hybrid adjacency and time-based data structure for analysis of temporal networks

This page was built for publication: Time windowed data structures for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121517)