Minimum spanning trees in temporal graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn 2015-May, Issue , 2015, Pages 419-430

  Huang, Silu ^a   Fu, Ada Wai Chee ^a   Liu, Ruifeng ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; COMPLEX NETWORKS; OPTIMIZATION; TEMPORAL LOGIC;

APPROXIMATION FACTOR; DIRECTED STEINER TREES; EFFICIENT APPROXIMATION ALGORITHMS; LINEAR-TIME ALGORITHMS; MINIMUM SPANNING TREES; STATE-OF-THE-ART ALGORITHMS; TEMPORAL NETWORKS; TIME INFORMATION;

TREES (MATHEMATICS);

EID: 84942252792     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2723372.2723717     Document Type: Conference Paper

References (33)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In FOCS, pages 14-23, 1992.
2. T. Asano, B. Bhattacharya, M. Keil, and F. Yao. Clustering algorithms based on minimum and maximum spanning trees. In Symposium on Computational Geometry, pages 252-257, 1988.
3. N. Bailey. The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, 1975.
4. S. Bhadra and A. Ferreira. Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In Ad-Hoc, Mobile, and Wireless Networks, pages 259-270. Springer, 2003.
5. V. D. Blondel, M. Esch, C. Chan, F. Clerot, P. Deville, E. Huens, F. Morlot, Z. Smoreda, and C. Ziemlicki. Data for development: the d4d challenge on mobile phone data. In arXiv:1210.0137, Jan 2013.
6. P. Camerini, L. Fratta, and F. Maffioli. A note on finding optimum branchings. Networks, 9:309-312, 1979.
7. A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro. Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems, 27(5):387-408, 2012.
8. M. Charikar, C. Chekuri, T.-y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. In SODA, pages 192-200, 1998.
9. W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In 16th ACM SIGKDD, pages 1029-1038, 2010.
10. Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400, 1965.
11. J. Edmonds. Optimum branchings. J. Res. Nat. Bur. Standards, 71 B: 233-240, 1967.
12. H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6:109-122, 1986.
13. G. Galbiati, F. Maffioli, and A. Morzenti. A short note on the approximability of the maximum leaves spanning tree problem. Information Processing Letters, 52:45-49, 1994.
14. C. S. Helvig, G. Robins, and A. Zelikovsky. An improved approximation scheme for the group steiner problem. Networks, 37(1):8-20, 2001.
15. P. Holme and J. Saramäki. Temporal networks. CoRR, abs/1108.1780, 2011.
16. S. Huang, J. Cheng, and H. Wu. Temporal graph traversals: Definitions, algorithms, and applications. In arXiv:1401.1919, Jan 2014.
17. J. Shi and J. Malik. Normalized cuts and images egmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:888-905, 2000.
18. V. Kann. On the approximability of NP-complete optimization problems. PhD thesis, Royal Institute of Technology Stockholm, 1992.
19. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In ACM SIGKDD, pages 137-146, 2003.
20. D. Kempe, J. M. Kleinberg, and A. Kumar. Connectivity and inference problems for temporal networks. In STOC, pages 504-513, 2000.
21. G. Kossinets, J. M. Kleinberg, and D. J. Watts. The structure of information pathways in a social communication network. In KDD, pages 435-443, 2008.
22. J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48-50, 1956.
23. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. In 20th ACM STOC, 1988.
24. R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
25. R. E. Tarjan. Finding optimum branchings. Networks, 7:25-35, 1977.
26. P. Winter. Steiner problem in networks: a survey. Networks, 17:129-167, 1987.
27. H. Wu, J. Cheng, S. Huang, Y. Ke, Y. Lu, and Y. Xu. Path problems in temporal graphs. In VLDB, 2014.
28. L. Xiang, Q. Yuan, S. Zhao, L. Chen, X. Zhang, Q. Yang, and J. Sun. Temporal recommendation on graphs via long and short term preference fusion. In ACM SIGKDD, pages 723-732, 2010.
29. B.-M. B. Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci., 14(2):267-285, 2003.
30. Y. Xu, V. Olman, and D. Xu. Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning tree. Bioinformatics, 18:536-545, 2002.
31. C. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, C-20:68-86, 1971.
32. A. Zelikovsky. A series of approximation algorithms for the acyclic directed steiner tree problem. Algorithmica, 18:99-110, 1997.
33. C. Zhong, D. Miao, and R. Wang. A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recognition, 43:752-766, 2010.