{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T19:04:52Z","timestamp":1744052692467},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352301"},{"type":"electronic","value":"9783030352318"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35231-8_4","type":"book-chapter","created":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:30:38Z","timestamp":1573864238000},"page":"48-62","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating Minimum Temporal Paths Query Based on Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Mo","family":"Li","sequence":"first","affiliation":[]},{"given":"Junchang","family":"Xin","sequence":"additional","affiliation":[]},{"given":"Zhiqiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Huilin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"issue":"12","key":"4_CR1","first-page":"2710","volume":"29","author":"E Abdelhamid","year":"2017","unstructured":"Abdelhamid, E., Canim, M., Sadoghi, M., Bhattacharjee, B., Chang, Y.C., Kalnis, P.: Incremental frequent subgraph mining on large evolving graphs. TKDE 29(12), 2710\u20132723 (2017)","journal-title":"TKDE"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/2601412","volume":"47","author":"C Aggarwal","year":"2014","unstructured":"Aggarwal, C., Subbian, K.: Evolutionary network analysis: a survey. ACM Comput. Surv. (CSUR) 47(1), 10 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TCSS.2018.2831694","volume":"5","author":"N Alduaiji","year":"2018","unstructured":"Alduaiji, N., Datta, A., Li, J.: Influence propagation model for clique-based community detection in social networks. IEEE Trans. Comput. Soc. Syst. 5(2), 563\u2013575 (2018)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bogdanov, P., Mongiov\u00ec, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: ICDM, pp. 81\u201390 (2011)","DOI":"10.1109\/ICDM.2011.101"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","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":"10","key":"4_CR6","first-page":"1233","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. PVLDB 11(10), 1233\u20131246 (2018)","journal-title":"PVLDB"},{"key":"4_CR7","unstructured":"Chen, X., Zhang, C., Ge, B., Xiao, W.: Temporal social network: Storage, indexing and query processing. In: EDBT\/ICDT Workshops (2016)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In: ICDE, pp. 893\u2013902 (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"issue":"2","key":"4_CR9","first-page":"99","volume":"12","author":"B Ghosh","year":"2018","unstructured":"Ghosh, B., Ali, M.E., Choudhury, F.M., Apon, S.H., Sellis, T., Li, J.: The flexible socio spatial group queries. PVLDB 12(2), 99\u2013111 (2018)","journal-title":"PVLDB"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kong, X., Li, M., Li, J., Tian, K., Hu, X., Feng, X.: CoPFun: an urban co-occurrence pattern mining scheme based on regional function discovery. World Wide Web J., 1\u201326 (2018)","DOI":"10.1007\/s11280-018-0578-x"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-29919-8_14","volume-title":"Algorithmic Aspects of Cloud Computing","author":"A Kosmatopoulos","year":"2016","unstructured":"Kosmatopoulos, A., Giannakopoulou, K., Papadopoulos, A.N., Tsichlas, K.: An overview of methods for handling evolving graph sequences. In: Karydis, I., Sioutas, S., Triantafillou, P., Tsoumakos, D. (eds.) ALGOCLOUD 2015. LNCS, vol. 9511, pp. 181\u2013192. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29919-8_14"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Kossinets, G., Kleinberg, J., Watts, D.: The structure of information pathways in a social communication network. In: SIGKDD, pp. 435\u2013443 (2008)","DOI":"10.1145\/1401890.1401945"},{"issue":"8","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3016078.2851183","volume":"51","author":"Saeed Maleki","year":"2016","unstructured":"Maleki, S., Nguyen, D., Lenharth, A., Padua, D., Pingali, K.: DSMR: a shared and distributed memory algorithm for single-source shortest path problem. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, p. 39 (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74247-0_3","volume-title":"Algorithmic Methods for Railway Optimization","author":"M M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable information: models and algorithms. In: Geraets, F., Kroon, L., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Algorithmic Methods for Railway Optimization. LNCS, vol. 4359, pp. 67\u201390. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74247-0_3"},{"key":"4_CR16","unstructured":"Semertzidis, K., Pitoura, E., Lillis, K.: TimeReach: historical reachability queries on evolving graphs. In: EDBT, pp. 121\u2013132 (2015)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Tang, J., Musolesi, M., Mascolo, C., Latora, V.: Temporal distance metrics for social network analysis. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 31\u201336 (2009)","DOI":"10.1145\/1592665.1592674"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/1672308.1672329","volume":"40","author":"J Tang","year":"2010","unstructured":"Tang, J., Musolesi, M., Mascolo, C., Latora, V.: Characterising temporal distance and reachability in mobile and online social networks. ACM SIGCOMM Comput. Commun. Rev. 40(1), 118\u2013124 (2010)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"9","key":"4_CR19","first-page":"721","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. PVLDB 7(9), 721\u2013732 (2014)","journal-title":"PVLDB"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. In: ICDE, pp. 145\u2013156 (2016)","DOI":"10.1109\/ICDE.2016.7498236"},{"issue":"02","key":"4_CR21","doi-asserted-by":"publisher","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(02), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yan, D., Wu, H., Cheng, J., Zhou, S., Lui, J.: Diversified temporal subgraph pattern mining. In: SIGKDD, pp. 1965\u20131974 (2016)","DOI":"10.1145\/2939672.2939848"},{"issue":"4","key":"4_CR23","first-page":"240","volume":"9","author":"B Zong","year":"2015","unstructured":"Zong, B., et al.: Behavior query discovery in system-generated temporal graphs. PVLDB 9(4), 240\u2013251 (2015)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35231-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,16]],"date-time":"2019-11-16T00:32:45Z","timestamp":1573864365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35231-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352301","9783030352318"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35231-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2019.neusoft.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}