pith. sign in

arxiv: 1703.02852 · v1 · pith:5ZI7ISFVnew · submitted 2017-02-20 · 💻 cs.SI · physics.soc-ph

Introduction to a Temporal Graph Benchmark

classification 💻 cs.SI physics.soc-ph
keywords graphtemporalbenchmarkassociateddataedgeslabelstime
0
0 comments X
read the original abstract

A temporal graph is a data structure, consisting of nodes and edges in which the edges are associated with time labels. To analyze the temporal graph, the first step is to find a proper graph dataset/benchmark. While many temporal graph datasets exist online, none could be found that used the interval labels in which each edge is associated with a starting and ending time. Therefore we create a temporal graph data based on Wikipedia reference graph for temporal analysis. This report aims to provide more details of this graph benchmark to those who are interested in using it.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.