{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:41:14Z","timestamp":1743082874315,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914510"},{"type":"electronic","value":"9783319914527"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","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":[[2018]]},"DOI":"10.1007\/978-3-319-91452-7_14","type":"book-chapter","created":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T06:43:19Z","timestamp":1526107399000},"page":"203-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["External Topological Sorting in Large Graphs"],"prefix":"10.1007","author":[{"given":"Zhu","family":"Qing","sequence":"first","affiliation":[]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,13]]},"reference":[{"issue":"9","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J., et al.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"3.1","DOI":"10.1145\/2133803.2330083","volume":"17","author":"Deepak Ajwani","year":"2012","unstructured":"Ajwani, D., Cosgaya-Lozano, A., Zeh, N.: A topological sorting algorithm for large graphs. J. Exp. Algorithmics 17, Article No. 3.2 (2012)","journal-title":"Journal of Experimental Algorithmics"},{"issue":"1","key":"14_CR3","first-page":"56","volume":"6","author":"E Angel","year":"2011","unstructured":"Angel, E., Campigotto, R., Laforest, C.: Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities. Algorithmic Oper. Res. 6(1), 56\u201367 (2011)","journal-title":"Algorithmic Oper. Res."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/978-3-642-10631-6_116","volume-title":"Algorithms and Computation","author":"L Arge","year":"2009","unstructured":"Arge, L., Revsb\u00e6k, M.: I\/O-efficient contour tree simplification. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1155\u20131165. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_116"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ins.2013.08.046","volume":"256","author":"F Buccafurri","year":"2014","unstructured":"Buccafurri, F., Lax, G., Nocera, A., Ursino, D.: Moving from social networks to social internetworking scenarios: the crawling perspective. Inf. Sci. 256, 126\u2013137 (2014)","journal-title":"Inf. Sci."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: Proceedings of ICDE, pp. 51\u201362 (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng, J., Ke, Y., Fu, A.W.-C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks. TODS 36(4), 21 (2011)","journal-title":"TODS"},{"key":"14_CR8","unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E.: External-memory graph algorithms. In: SODA, vol. 95, pp. 139\u2013149 (1995)"},{"key":"14_CR9","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.-W.: Massive graph triangulation. In: Proceedings of SIGMOD, pp. 325\u2013336 (2013)","DOI":"10.1145\/2463676.2463704"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1137\/S0097539705446925","volume":"38","author":"A Maheshwari","year":"2008","unstructured":"Maheshwari, A., Zeh, N.: I\/O-efficient planar separators. SIAM J. Comput. 38(3), 767\u2013801 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith, A., Ehrgott, M.: A comparison of solution strategies for biobjective shortest path problems. Comput. Oper. Res. 36(4), 1299\u20131331 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00268499","volume":"6","author":"RE Tarjan","year":"1976","unstructured":"Tarjan, R.E.: Edge-disjoint spanning trees and depth-first search. Acta Inform. 6(2), 171\u2013185 (1976)","journal-title":"Acta Inform."},{"issue":"9","key":"14_CR14","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. Proc. VLDB Endow. 5(9), 812\u2013823 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. VLDB J. 25(2), 171\u2013196 (2016)","journal-title":"VLDB J."},{"issue":"7","key":"14_CR16","first-page":"516","volume":"9","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: I\/O efficient ECC graph decomposition via graph reduction. PVLDB 9(7), 516\u2013527 (2016)","journal-title":"PVLDB"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00778-016-0451-4","volume":"26","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: I\/O efficient ECC graph decomposition via graph reduction. VLDB J. 26(2), 275\u2013300 (2017)","journal-title":"VLDB J."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Yu, J.X., Qin, L., Shang, Z.: Divide & conquer: I\/O efficient depth-first search. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 445\u2013458 (2015)","DOI":"10.1145\/2723372.2723740"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91452-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:14:31Z","timestamp":1709831671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91452-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319914510","9783319914527"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91452-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ict.griffith.edu.au\/conferences\/dasfaa2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}