Advertisement

Minimum Spanning Tree on Uncertain Graphs

  • Anzhen ZhangEmail author
  • Zhaonian Zou
  • Jianzhong Li
  • Hong Gao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10042)

Abstract

In recent years, lots of data in various domain can be represented and described by uncertain graph model, such as protein interaction networks, social networks, wireless sensor networks, etc. This paper investigates the most reliable minimum spanning tree problem, which aims to find the minimum spanning tree (MST) with largest probability among all possible MSTs on uncertain graphs. In fact, the most reliable MST is an optimal choice between stability and cost. Therefore it has wide applications in practice, for example, it can serve as the basic constructs in a telecommunication network, the link of which can be unreliable and may fail with certain probability. A brute-force method needs to enumerate all possible MSTs and the time consumption grows exponentially with edge size. Hence we put forward an approximate algorithm in \(O(d^{2}|V|^{2})\), where d is the largest vertex degree and |V| is vertex size. We point out that the algorithm can achieve exact solution with expected probability at least \((1-(\frac{1}{2})^{(d+1)/2})^{|V|-1}\) and the expected approximation ratio is at least \((\frac{1}{2})^{d|V|}\) when edge probability is uniformly distributed. Our extensive experimental results show that our proposed algorithm is both efficient and effective.

References

  1. 1.
    Potamias, M., Bonchi, F., Gionis, A., et al.: K-nearest neighbors in uncertain graphs. In: VLDB (2010)Google Scholar
  2. 2.
    Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)CrossRefGoogle Scholar
  3. 3.
    Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48–50 (1956)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: SIGKDD (2010)Google Scholar
  5. 5.
    Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777–788 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS, vol. 4075, pp. 35–49. Springer, Heidelberg (2006). doi: 10.1007/11799511_5 CrossRefGoogle Scholar
  7. 7.
    Kamousi, P., Suri, S.: Stochastic minimum spanning trees and related problems. In: ANALCO (2011)Google Scholar
  8. 8.
    Huang, L., Li, J.: Minimum spanning trees, perfect matchings and cycle covers over stochastic points in metric spaces. In: arXiv preprint arXiv (2012)Google Scholar
  9. 9.
    Frieze, A.M.: On the value of a random minimum spanning tree problem. Discret. Appl. Math. 10(1), 47–56 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Steele, J.M.: On Frieze’s (3) limit for lengths of minimal spanning trees. Discret. Appl. Math. 18(1), 99–103 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Ball, M.O.: Computational complexity of network reliability analysis: an overview. IEEE Trans. Reliab. 35(3), 230–239 (1986)CrossRefzbMATHGoogle Scholar
  12. 12.
    Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: ICDE (2007)Google Scholar
  13. 13.
    Pei, J., Jiang, B., Lin, X., et al.: Probabilistic skylines on uncertain data. In: VLDB (2007)Google Scholar
  14. 14.
    Jin, R., Liu, L., Aggarwal, C.C.: Discovering highly reliable subgraphs in uncertain graphs. In: SIGKDD (2011)Google Scholar
  15. 15.
    Wu, Y., Fahmy, S., Shroff, N.B.: On the construction of a maximum-lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm. In: INFOCOM (2008)Google Scholar
  16. 16.
    Manfredi, V., Hancock, R., Kurose, J.: Robust routing in dynamic manets. In: Annual Conference of the International Technology Alliance (2008)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Anzhen Zhang
    • 1
    Email author
  • Zhaonian Zou
    • 1
  • Jianzhong Li
    • 1
  • Hong Gao
    • 1
  1. 1.Harbin Institute of TechnologyHarbinChina

Personalised recommendations