Abstract
We consider the shortest path problem in evolving graphs with restricted access, i.e., the changes are unknown and can be probed only by limited queries. The goal is to maintain a shortest path between a given pair of nodes. We propose a heuristic algorithm that takes into account time-dependent edge reliability and reduces the problem to find an edge-weighted shortest path. Our algorithm leads to higher precision and recall than those of the existing method introduced in [5] on both real-life data and synthetic data, while the error is negligible.
The work is partially supported by National Natural Science Foundation of China (61222202, 61433014, 61502449) and the China National Program for support of Top-notch Young Professionals.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Trans. Algorithms 12, 1–19 (2015)
Albert, R.: Statistical mechanics of complex networks (2001)
Albers, S.: Online algorithms: a survey. Math. Programm. 97(1–2), 3–26 (2003)
Anagnostopoulos, A., Kumar, R., Mahdian, M., Upfal, E.: Sort me if you can: how to sort dynamic data. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 339–350. Springer, Heidelberg (2009)
Anagnostopoulos, A., Kumar, R., Mahdian, M., Upfal, E., Vandin, F.: Algorithms on evolving graphs. In: Proceedings of the 3rd Innovations in Theoretical Computer Science (ITCS), pp. 149–160 (2012)
Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.G.: DBpedia: a nucleus for a web of open data. In: Aberer, K., et al. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 722–735. Springer, Heidelberg (2007)
Bahmani, B., Kumar, R., Mahdian, M., Upfal, E.: Pagerank on an evolving graph. In: Proceedings of KDD 2012, pp. 24–32 (2012)
Bressan, M., Peserico, E., Pretto, L.: Approximating pagerank locally with sublinear query complexity. ArXiv preprint (2014)
Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387–408 (2012)
Chung, F., Lu, L.: The diameter of sparse random graphs. Adv. Appl. Math. 26(4), 257–279 (2001)
De Choudhury, M., Lin, Y.-R., Sundaram, H., Candan, K.S., Xie, L., Kelliher, A.: How does the data sampling strategy impact the discovery of information diffusion in social media? In: Proceedings of ICWSM 2010, pp. 34–41 (2010)
Demetrescu, C., Italiano, G.F.: Algorithmic techniques for maintaining shortest routes in dynamic networks. Electr. Notes Theor. Comput. Sci. 171(1), 3–15 (2007)
Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Atallah, M.J. (ed.) Algorithms and Theoretical Computing Handbook. CRC Press, Boca Raton (1999)
Erdős, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5, 17–61 (1960)
Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001–1018 (1994)
Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Mishima, T., Onizuka, M.: Fast and exact top-k algorithm for pagerank. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence, pp. 1106–1112 (2013)
Huo, W., Tsotras, V.J.: Efficient temporal shortest path queries on evolving social graphs. In: Proceedings of the 26th International Conference on Scientific and Statistical Database Management (SSDBM) (2014). Article No. 38
Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theoret. Comput. Sci. 1(2), 117–236 (2005)
Preusse, J., Kunegis, J., Thimm, M., Gottron, T., Staab, S.: Structural dynamics of knowledge networks. In: Proceedings of ICWSM 2013 (2013)
Ren, C.: Algorithms for evolving graph analysis. Ph.D. thesis, The University of Hong Kong (2014)
Salathé, M., Kazandjieva, M., Lee, J.W., Levis, P., Feldman, M.W., Jones, J.H.: A high-resolution human contact network for infectious disease transmission. Proc. Nat. Acad. Sci. 107(51), 22020–22025 (2010)
Sarma, A.D., Gollapudi, C., Panigrahy, R.: Estimating pagerank on graph streams. J. ACM 58(3), 13 (2011)
Xuan, B.B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267–285 (2003)
Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: Proceedings of 2012 ACM SIGKDD Workshop on Mining Data Semantics, pp. 3:1–3:8. ACM, New York (2012). Article No. 3
Zhuang, H., Sun, Y., Tang, J., Zhang, J., Sun, X.: Influence maximization in dynamic social networks. In: Proceedings of the 13th IEEE International Conference on Data Mining (ICDM), pp. 1313–1318. IEEE (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Zou, Y. et al. (2016). Shortest Paths on Evolving Graphs. In: Nguyen, H., Snasel, V. (eds) Computational Social Networks. CSoNet 2016. Lecture Notes in Computer Science(), vol 9795. Springer, Cham. https://doi.org/10.1007/978-3-319-42345-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-42345-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42344-9
Online ISBN: 978-3-319-42345-6
eBook Packages: Computer ScienceComputer Science (R0)