{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:48:59Z","timestamp":1725860939884},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319423449"},{"type":"electronic","value":"9783319423456"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42345-6_1","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T13:11:03Z","timestamp":1468242663000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Shortest Paths on Evolving Graphs"],"prefix":"10.1007","author":[{"given":"Yiming","family":"Zou","sequence":"first","affiliation":[]},{"given":"Gang","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Yuyi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xingwu","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Jialin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2701427","volume":"12","author":"M Ajtai","year":"2015","unstructured":"Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Trans. Algorithms 12, 1\u201319 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR2","unstructured":"Albert, R.: Statistical mechanics of complex networks (2001)"},{"issue":"1\u20132","key":"1_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S Albers","year":"2003","unstructured":"Albers, S.: Online algorithms: a survey. Math. Programm. 97(1\u20132), 3\u201326 (2003)","journal-title":"Math. Programm."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-642-02930-1_28","volume-title":"Automata, Languages and Programming","author":"A Anagnostopoulos","year":"2009","unstructured":"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\u2013350. Springer, Heidelberg (2009)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013160 (2012)","DOI":"10.1145\/2090236.2090249"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"The Semantic Web","author":"S Auer","year":"2007","unstructured":"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\u2013735. Springer, Heidelberg (2007)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kumar, R., Mahdian, M., Upfal, E.: Pagerank on an evolving graph. In: Proceedings of KDD 2012, pp. 24\u201332 (2012)","DOI":"10.1145\/2339530.2339539"},{"key":"1_CR8","unstructured":"Bressan, M., Peserico, E., Pretto, L.: Approximating pagerank locally with sublinear query complexity. ArXiv preprint (2014)"},{"issue":"5","key":"1_CR9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"4","key":"1_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F Chung","year":"2001","unstructured":"Chung, F., Lu, L.: The diameter of sparse random graphs. Adv. Appl. Math. 26(4), 257\u2013279 (2001)","journal-title":"Adv. Appl. Math."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"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\u201341 (2010)","DOI":"10.1609\/icwsm.v4i1.14024"},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.entcs.2006.11.006","volume":"171","author":"C Demetrescu","year":"2007","unstructured":"Demetrescu, C., Italiano, G.F.: Algorithmic techniques for maintaining shortest routes in dynamic networks. Electr. Notes Theor. Comput. Sci. 171(1), 3\u201315 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR13","volume-title":"Algorithms and Theoretical Computing Handbook","author":"D Eppstein","year":"1999","unstructured":"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)"},{"key":"1_CR14","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"issue":"5","key":"1_CR15","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U Feige","year":"1994","unstructured":"Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001\u20131018 (1994)","journal-title":"SIAM J. Comput."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"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\u20131112 (2013)","DOI":"10.1609\/aaai.v27i1.8454"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/2618243.2618282"},{"issue":"2","key":"1_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theoret. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"key":"1_CR19","unstructured":"Preusse, J., Kunegis, J., Thimm, M., Gottron, T., Staab, S.: Structural dynamics of knowledge networks. In: Proceedings of ICWSM 2013 (2013)"},{"key":"1_CR20","unstructured":"Ren, C.: Algorithms for evolving graph analysis. Ph.D. thesis, The University of Hong Kong (2014)"},{"issue":"51","key":"1_CR21","doi-asserted-by":"crossref","first-page":"22020","DOI":"10.1073\/pnas.1009094108","volume":"107","author":"M Salath\u00e9","year":"2010","unstructured":"Salath\u00e9, 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\u201322025 (2010)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"1_CR22","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1970392.1970397","volume":"58","author":"AD Sarma","year":"2011","unstructured":"Sarma, A.D., Gollapudi, C., Panigrahy, R.: Estimating pagerank on graph streams. J. ACM 58(3), 13 (2011)","journal-title":"J. ACM"},{"issue":"2","key":"1_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BB Xuan","year":"2003","unstructured":"Xuan, B.B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"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\u20133:8. ACM, New York (2012). Article No. 3","DOI":"10.1109\/ICDM.2012.138"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"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\u20131318. IEEE (2013)","DOI":"10.1109\/ICDM.2013.145"}],"container-title":["Lecture Notes in Computer Science","Computational Social Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42345-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T05:23:47Z","timestamp":1692422627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42345-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319423449","9783319423456"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42345-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}