A hybrid adjacency and time-based data structure for analysis of temporal networks

A hybrid adjacency and time-based data structure for analysis of temporal networks

Abstract Dynamic or temporal networks enable representation of time-varying edges between nodes. Conventional adjacency-based data structures used for storing networks such as adjacency lists were designed without incorporating time and can thus quickly retrieve all edges between two sets of nodes (...

Full description

Bibliographic Details
Main Authors: Tanner Hilsabeck, Makan Arastuie, Kevin S. Xu
Format: Article
Language:English
Published: SpringerOpen 2022-07-01
Series:Applied Network Science
Subjects:
Dynamic graph structure
Hybrid data structure
Dynamic network
Interval tree
Adjacency dictionary
Predictive compound slice
Online Access:https://doi.org/10.1007/s41109-022-00489-5

Internet

https://doi.org/10.1007/s41109-022-00489-5

Similar Items