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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Potamias, M., Bonchi, F., Gionis, A., et al.: K-nearest neighbors in uncertain graphs. In: VLDB (2010)
Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)
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)
Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: SIGKDD (2010)
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)
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
Kamousi, P., Suri, S.: Stochastic minimum spanning trees and related problems. In: ANALCO (2011)
Huang, L., Li, J.: Minimum spanning trees, perfect matchings and cycle covers over stochastic points in metric spaces. In: arXiv preprint arXiv (2012)
Frieze, A.M.: On the value of a random minimum spanning tree problem. Discret. Appl. Math. 10(1), 47–56 (1985)
Steele, J.M.: On Frieze’s (3) limit for lengths of minimal spanning trees. Discret. Appl. Math. 18(1), 99–103 (1987)
Ball, M.O.: Computational complexity of network reliability analysis: an overview. IEEE Trans. Reliab. 35(3), 230–239 (1986)
Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: ICDE (2007)
Pei, J., Jiang, B., Lin, X., et al.: Probabilistic skylines on uncertain data. In: VLDB (2007)
Jin, R., Liu, L., Aggarwal, C.C.: Discovering highly reliable subgraphs in uncertain graphs. In: SIGKDD (2011)
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)
Manfredi, V., Hancock, R., Kurose, J.: Robust routing in dynamic manets. In: Annual Conference of the International Technology Alliance (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Zhang, A., Zou, Z., Li, J., Gao, H. (2016). Minimum Spanning Tree on Uncertain Graphs. In: Cellary, W., Mokbel, M., Wang, J., Wang, H., Zhou, R., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2016. WISE 2016. Lecture Notes in Computer Science(), vol 10042. Springer, Cham. https://doi.org/10.1007/978-3-319-48743-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-48743-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48742-7
Online ISBN: 978-3-319-48743-4
eBook Packages: Computer ScienceComputer Science (R0)