{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T17:44:33Z","timestamp":1772559873950,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T00:00:00Z","timestamp":1411516800000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00778-014-0372-z","type":"journal-article","created":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T23:23:28Z","timestamp":1411514608000},"page":"245-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["I\/O efficient: computing SCCs in massive graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Zhiwei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,24]]},"reference":[{"key":"372_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Buchsbaum, A.L., Westbrook, J.: A functional approach to external graph algorithms. Algorithmica 32(3), 437\u2013458 (2002)","DOI":"10.1007\/s00453-001-0088-5"},{"key":"372_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","DOI":"10.1145\/48529.48535"},{"key":"372_CR3","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)"},{"key":"372_CR4","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Dementiev, R., Meyer, U.: A computational study of external-memory bfs algorithms. In: Proceedings of SODA\u201906 (2006)","DOI":"10.1145\/1109557.1109623"},{"key":"372_CR5","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Meyer, U.: Algorithmics of Large and Complex Networks, Chapter 1: Design and Engineering of External Memory Traversal Algorithms for General Graphs. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02094-0_1"},{"key":"372_CR6","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Meyer, U., Osipov, V.: Improved external memory bfs implementation. In: Proceedings of ALENEX\u201907 (2007)","DOI":"10.1137\/1.9781611972870.1"},{"key":"372_CR7","unstructured":"Buchsbaum, A.L., Goldwasser, M.H., Venkatasubramanian, S., Westbrook, J.: On external memory graph traversal. In: Proceedings of SODA\u201900 (2000)"},{"key":"372_CR8","unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proceedings of SODA\u201995 (1995)"},{"key":"372_CR9","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill, NY (2001)"},{"key":"372_CR10","doi-asserted-by":"crossref","unstructured":"Cosgaya-Lozano, A., Zeh, N.: A heuristic strong connectivity algorithm for large graphs. In: Proceedings of SEA\u201909 (2009)","DOI":"10.1007\/978-3-642-02011-7_12"},{"key":"372_CR11","unstructured":"Dementiev, R., Sanders, P., Schultes, D., Sibeyn, J.F.: Engineering an external memory minimum spanning tree algorithm. In: IFIP TCS (2004)"},{"key":"372_CR12","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Wang, H., Wu, Y.: Graph homomorphism revisited for graph matching. PVLDB 3(1), 1161\u20131172 (2010)","DOI":"10.14778\/1920841.1920986"},{"key":"372_CR13","doi-asserted-by":"crossref","unstructured":"Hellings, J., Fletcher, G.H., Haverkort, H.: Efficient external-memory bisimulation on dags. In: Proceedings of SIGMOD\u201912 (2012)","DOI":"10.1145\/2213836.2213899"},{"key":"372_CR14","doi-asserted-by":"crossref","unstructured":"Kumar, V., Schwabe, E.J.: Improved algorithms and data structures for solving graph problems in external memory. In: Proceedings of SPDP\u201996 (1996)","DOI":"10.1109\/SPDP.1996.570330"},{"key":"372_CR15","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: large-scale graph computation on just a pc. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201912, pp. 31\u201346, Berkeley, CA, USA. USENIX Association (2012)"},{"key":"372_CR16","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear i\/o. In: Proceedings of ESA\u201902 (2002)","DOI":"10.1007\/3-540-45749-6_63"},{"key":"372_CR17","doi-asserted-by":"crossref","unstructured":"Meyer, U., Osipov, V.: Design and implementation of a practical i\/o-efficient shortest paths algorithm. In: Proceedings of ALENEX\u201909 (2009)","DOI":"10.1137\/1.9781611972894.9"},{"key":"372_CR18","doi-asserted-by":"crossref","unstructured":"Meyer, U., Zeh, N.: I\/O-efficient undirected shortest paths. In: Proceedings of ESA\u201903 (2003)","DOI":"10.1007\/978-3-540-39658-1_40"},{"key":"372_CR19","doi-asserted-by":"crossref","unstructured":"Meyer, U., Zeh, N.: I\/O-efficient undirected shortest paths with unbounded edge lengths. In: Proceedings of ESA\u201906 (2006)","DOI":"10.1007\/11841036_49"},{"key":"372_CR20","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F.: External connected components. In: Proceedings of SWAT\u201904 (2004)","DOI":"10.1007\/978-3-540-27810-8_40"},{"key":"372_CR21","doi-asserted-by":"crossref","unstructured":"Sibeyn, J.F., Abello, J., Meyer, U.: Heuristics for semi-external depth first search on directed graphs. In: Proceedings of SPAA\u201902 (2002)","DOI":"10.1145\/564870.564917"},{"issue":"2","key":"372_CR22","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"372_CR23","doi-asserted-by":"crossref","unstructured":"Vitter, J.S.: External memory algorithms and data structures. ACM Comput. Surv. 33(2), 209\u2013271 (2001)","DOI":"10.1145\/384192.384193"},{"key":"372_CR24","doi-asserted-by":"crossref","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: scalable reachability index for large graphs. PVLDB, 3(1), 276\u2013284 (2010)","DOI":"10.14778\/1920841.1920879"},{"key":"372_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Yu, J.X., Qin, L., Chang, L., Lin, X.: I\/o efficient: computing sccs in massive graphs. In: Proceedings of SIGMOD\u201913 (2013)","DOI":"10.1145\/2463676.2463703"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0372-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-014-0372-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0372-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T09:17:08Z","timestamp":1565860628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-014-0372-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,24]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["372"],"URL":"https:\/\/doi.org\/10.1007\/s00778-014-0372-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,24]]}}}