Minimum Spanning Trees in Temporal Graphs

ACM SIGMOD Conference, pp. 419-430, 2015.

Cited by: 41|Bibtex|Views59|DOI:https://doi.org/10.1145/2723372.2723717
EI
Other Links: dl.acm.org|academic.microsoft.com|dblp.uni-trier.de

Abstract:

The computation of Minimum Spanning Trees (MSTs) is a fundamental graph problem with important applications. However, there has been little study of MSTs for temporal graphs, which is becoming common as time information is collected for many existing networks. We define two types of MSTs for temporal graphs, MSTa and MSTw, based on the op...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments