Minimum Spanning Trees In Temporal Graphs
MOD(2015)
摘要
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, MST alpha and MST omega based on the optimization of time and cost, respectively. We propose efficient linear time algorithms for computing MST alpha. We show that computing MST omega is much harder. We design efficient approximation algorithms based on a transformation to the Directed Steiner Tree problem (DST). Our solution also solves the classical DST problem with a better time complexity and the same approximation factor compared to the state-of-the-art algorithm. Our experiments on real temporal networks further verify the effectiveness of our algorithms. For MST omega our solution is capable of shortening the runtime from 10 hours to 3 seconds.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络