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

DOI10.1007/978-3-030-93409-5_49OpenAlexW4205535261MaRDI QIDQ2086647

Kevin S. Xu, Tanner Hilsabeck, Makan Arastuie

Publication date: 25 October 2022

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

zbMATH Keywords

dynamic networkinterval treerelational eventsadjacency dictionarydynamic graph structuretimestamped network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Uses Software

• NetworkX
• SNAP
• GitHub

Cites Work

• Unnamed Item
• Scan statistics on Enron graphs
• Multiaspect graphs: algebraic representation and algorithms
• What's in a crowd? Analysis of face-to-face behavioral networks
• Incidence matrices and interval graphs
• A Guide to Temporal Networks
• Temporal Network Theory

This page was built for publication: A hybrid adjacency and time-based data structure for analysis of temporal networks