STINGER: Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation David A. Bader Georgia Institute of Technolgy Jonathan Berry Sandia National Laboratories Adam Amos-Binks Carleton University, Canada Daniel Chavarr´ ıa-Miranda Pacific Northwest National Laboratory Charles Hastings Hayden Software Consulting, Inc. Kamesh Madduri Lawrence Berkeley National Laboratory Steven C. Poulos U.S. Department of Defense May 8, 2009 Abstract In this document, we propose a dynamic graph data structure that can serve as a common data structure for multiple real-world applications. The extensible represen- tation for dynamic complex networks is space-efficient, allows parallelism over vertices and edges independently, and can be used for efficient checkpoint/restart of the data. 1 Motivation A graph is a set of vertices and edges and has proved to be a useful abstraction for solving real- world problems across many domains such as transportation, biological sciences, electrical engineering, and social networks. The abstract data structures to date for representing graphs primarily focus on static graph instances, such as the adjacency matrix for dense graphs and adjacency lists for sparse graphs. Many problems today can be formulated as dynamic spatio-temporal graph problems. For example, one may wish to track communities within social networks on Facebook as edges (friendship pairs) are added or removed. Or more interestingly, one may look for people who bridge between different social communities, or switch allegiances over time. 1