메뉴 건너뛰기




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

Minimum spanning trees in temporal graphs

Author keywords

[No Author keywords available]

Indexed keywords

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

EID: 84942252792     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2723372.2723717     Document Type: Conference Paper
Times cited : (85)

References (33)
  • 1
    • 85028925878 scopus 로고
    • Proof verification and hardness of approximation problems
    • S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In FOCS, pages 14-23, 1992.
    • (1992) FOCS , pp. 14-23
    • Arora, S.1    Lund, C.2    Motwani, R.3    Sudan, M.4    Szegedy, M.5
  • 4
    • 0142156669 scopus 로고    scopus 로고
    • Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks
    • Springer
    • 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.
    • (2003) Ad-hoc, Mobile, and Wireless Networks , pp. 259-270
    • Bhadra, S.1    Ferreira, A.2
  • 6
    • 0018767509 scopus 로고
    • A note on finding optimum branchings
    • P. Camerini, L. Fratta, and F. Maffioli. A note on finding optimum branchings. Networks, 9:309-312, 1979.
    • (1979) Networks , vol.9 , pp. 309-312
    • Camerini, P.1    Fratta, L.2    Maffioli, F.3
  • 9
    • 77956192689 scopus 로고    scopus 로고
    • Scalable influence maximization for prevalent viral marketing in large-scale social networks
    • 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.
    • (2010) 16th ACM SIGKDD , pp. 1029-1038
    • Chen, W.1    Wang, C.2    Wang, Y.3
  • 10
    • 0000666661 scopus 로고
    • On the shortest arborescence of a directed graph
    • Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400, 1965.
    • (1965) Science Sinica , vol.14 , pp. 1396-1400
    • Chu, Y.J.1    Liu, T.H.2
  • 12
    • 51249176707 scopus 로고
    • Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
    • 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.
    • (1986) Combinatorica , vol.6 , pp. 109-122
    • Gabow, H.N.1    Galil, Z.2    Spencer, T.3    Tarjan, R.E.4
  • 13
    • 0028517406 scopus 로고
    • A short note on the approximability of the maximum leaves spanning tree problem
    • 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.
    • (1994) Information Processing Letters , vol.52 , pp. 45-49
    • Galbiati, G.1    Maffioli, F.2    Morzenti, A.3
  • 14
    • 0035218510 scopus 로고    scopus 로고
    • An improved approximation scheme for the group steiner problem
    • C. S. Helvig, G. Robins, and A. Zelikovsky. An improved approximation scheme for the group steiner problem. Networks, 37(1):8-20, 2001.
    • (2001) Networks , vol.37 , Issue.1 , pp. 8-20
    • Helvig, C.S.1    Robins, G.2    Zelikovsky, A.3
  • 19
    • 33747172362 scopus 로고    scopus 로고
    • Maximizing the spread of influence through a social network
    • D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In ACM SIGKDD, pages 137-146, 2003.
    • (2003) ACM SIGKDD , pp. 137-146
    • Kempe, D.1    Kleinberg, J.2    Tardos, É.3
  • 20
    • 0033708136 scopus 로고    scopus 로고
    • Connectivity and inference problems for temporal networks
    • D. Kempe, J. M. Kleinberg, and A. Kumar. Connectivity and inference problems for temporal networks. In STOC, pages 504-513, 2000.
    • (2000) STOC , pp. 504-513
    • Kempe, D.1    Kleinberg, J.M.2    Kumar, A.3
  • 21
    • 65449153304 scopus 로고    scopus 로고
    • The structure of information pathways in a social communication network
    • 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.
    • (2008) KDD , pp. 435-443
    • Kossinets, G.1    Kleinberg, J.M.2    Watts, D.J.3
  • 22
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • 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.
    • (1956) Proceedings of the American Mathematical Society , vol.7 , pp. 48-50
    • Kruskal, J.1
  • 23
  • 24
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
    • (1957) Bell System Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.1
  • 25
    • 0017465744 scopus 로고
    • Finding optimum branchings
    • R. E. Tarjan. Finding optimum branchings. Networks, 7:25-35, 1977.
    • (1977) Networks , vol.7 , pp. 25-35
    • Tarjan, R.E.1
  • 26
    • 84987034438 scopus 로고
    • Steiner problem in networks: A survey
    • P. Winter. Steiner problem in networks: a survey. Networks, 17:129-167, 1987.
    • (1987) Networks , vol.17 , pp. 129-167
    • Winter, P.1
  • 28
    • 77956220287 scopus 로고    scopus 로고
    • Temporal recommendation on graphs via long and short term preference fusion
    • 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.
    • (2010) ACM SIGKDD , pp. 723-732
    • Xiang, L.1    Yuan, Q.2    Zhao, S.3    Chen, L.4    Zhang, X.5    Yang, Q.6    Sun, J.7
  • 29
    • 1942450221 scopus 로고    scopus 로고
    • Computing shortest, fastest, and foremost journeys in dynamic networks
    • 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.
    • (2003) Int. J. Found. Comput. Sci. , vol.14 , Issue.2 , pp. 267-285
    • Xuan, B.B.-M.1    Ferreira, A.2    Jarry, A.3
  • 30
    • 0035999974 scopus 로고    scopus 로고
    • Clustering gene expression data using a graph-theoretic approach: An application of minimum spanning tree
    • 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.
    • (2002) Bioinformatics , vol.18 , pp. 536-545
    • Xu, Y.1    Olman, V.2    Xu, D.3
  • 31
    • 0014976008 scopus 로고
    • Graph-theoretical methods for detecting and describing gestalt clusters
    • C. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, C-20:68-86, 1971.
    • (1971) IEEE Transactions on Computers , vol.C-20 , pp. 68-86
    • Zahn, C.1
  • 32
    • 0001849774 scopus 로고    scopus 로고
    • A series of approximation algorithms for the acyclic directed steiner tree problem
    • A. Zelikovsky. A series of approximation algorithms for the acyclic directed steiner tree problem. Algorithmica, 18:99-110, 1997.
    • (1997) Algorithmica , vol.18 , pp. 99-110
    • Zelikovsky, A.1
  • 33
    • 70449713359 scopus 로고    scopus 로고
    • A graph-theoretical clustering method based on two rounds of minimum spanning trees
    • 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.
    • (2010) Pattern Recognition , vol.43 , pp. 752-766
    • Zhong, C.1    Miao, D.2    Wang, R.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.