Proceedings ArticleDOI
Minimum Spanning Trees in Temporal Graphs
Silu Huang,Ada Wai-Chee Fu,Ruifeng Liu +2 more
- pp 419-430
Reads0
Chats0
TLDR
This work designs efficient approximation algorithms based on a transformation to the Directed Steiner Tree problem (DST) with a better time complexity and the same approximation factor compared to the state-of-the-art algorithm.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 optimization of time and cost, respectively. We propose efficient linear time algorithms for computing MSTa. We show that computing MSTw 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 MSTw, our solution is capable of shortening the runtime from 10 hours to 3 seconds.read more
Citations
More filters
Journal ArticleDOI
Modern temporal network theory: a colloquium
TL;DR: In this article, the authors present a review of methods to analyze and model temporal networks and processes taking place on them, focusing mainly on the last three years, including spreading of infectious disease, opinions, rumors, in social networks; information packets in computer networks; various types of signaling in biology, and more.
Journal ArticleDOI
Modern temporal network theory: A colloquium
TL;DR: This colloquium reviews the methods to analyze and model temporal networks and processes taking place on them, focusing mainly on the last three years, which includes the spreading of infectious disease, opinions, rumors, in social networks; information packets in computer networks; various types of signaling in biology, and more.
Proceedings ArticleDOI
Persistent Community Search in Temporal Networks
TL;DR: It is proved that the problem of identifying the maximum (θ,⊺) persistent k-core is NP-hard, and a novel branch and bound algorithm with several carefully-designed pruning rules to find the maximum-persistent community is proposed.
Journal ArticleDOI
Time-Dependent Graphs: Definitions, Applications, and Algorithms
TL;DR: The definition and topological structure of time-dependent graphs, as well as models for their relationship to dynamic systems, are discussed and some classic problems on time- dependent graphs are reviewed, e.g., route planning, social analysis, and subgraph problem (including matching and mining).
Proceedings ArticleDOI
Reconstructing an Epidemic Over Time
TL;DR: CulT is developed, a scalable and effective algorithm to reconstruct epidemics that is also suited for online settings, by formulating the problem as that of a temporal Steiner-tree computation, for which a fast algorithm leveraging the specific problem structure is designed.
References
More filters
Journal ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Proceedings ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Proceedings ArticleDOI
Maximizing the spread of influence through a social network
TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Journal ArticleDOI
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.