{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T18:02:04Z","timestamp":1750356124994,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463676.2463703","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"181-192","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["I\/O efficient"],"prefix":"10.1145","author":[{"given":"Zhiwei","family":"Zhang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, Australia"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A functional approach to external graph algorithms. Algorithmica, 32(3)","author":"Abello J.","year":"2002","unstructured":"J. Abello , A. L. Buchsbaum , and J. Westbrook . A functional approach to external graph algorithms. Algorithmica, 32(3) , 2002 . J. Abello, A. L. Buchsbaum, and J. Westbrook. A functional approach to external graph algorithms. Algorithmica, 32(3), 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_3_1","volume-title":"Data Structures and Algorithms","author":"Aho A. V.","year":"1983","unstructured":"A. V. Aho , J. E. Hopcroft , and J. D. Ullman . Data Structures and Algorithms . Addison-Wesley , 1983 . A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109623"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.1"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of SODA'00","author":"Buchsbaum A. L.","year":"2000","unstructured":"A. L. Buchsbaum , M. H. Goldwasser , S. Venkatasubramanian , and J. Westbrook . On external memory graph traversal . In Proc. of SODA'00 , 2000 . A. L. Buchsbaum, M. H. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In Proc. of SODA'00, 2000."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of SODA'95","author":"Chiang Y.-J.","year":"1995","unstructured":"Y.-J. Chiang , M. T. Goodrich , E. F. Grove , R. Tamassia , D. E. Vengroff , and J. S. Vitter . External-memory graph algorithms . In Proc. of SODA'95 , 1995 . Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. of SODA'95, 1995."},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. Stein , R. L. Rivest , and C. E. Leiserson . Introduction to Algorithms . McGraw-Hill , 2001 . T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02011-7_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8141-3_17"},{"key":"e_1_3_2_1_12_1","volume-title":"Graph homomorphism revisited for graph matching. PVLDB, 3(1)","author":"Fan W.","year":"2010","unstructured":"W. Fan , J. Li , S. Ma , H. Wang , and Y. Wu . Graph homomorphism revisited for graph matching. PVLDB, 3(1) , 2010 . W. Fan, J. Li, S. Ma, H. Wang, and Y. Wu. Graph homomorphism revisited for graph matching. PVLDB, 3(1), 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213899"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/829517.830723"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740673"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_40"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_49"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_40"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564917"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"e_1_3_2_1_22_1","volume-title":"Grail: Scalable reachability index for large graphs. PVLDB, 3(1)","author":"Yildirim H.","year":"2010","unstructured":"H. Yildirim , V. Chaoji , and M. J. Zaki . Grail: Scalable reachability index for large graphs. PVLDB, 3(1) , 2010 . H. Yildirim, V. Chaoji, and M. J. Zaki. Grail: Scalable reachability index for large graphs. PVLDB, 3(1), 2010."}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"New York New York USA","acronym":"SIGMOD\/PODS'13"},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2463703","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2463703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:01Z","timestamp":1750235941000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2463703"}},"subtitle":["computing SCCs in massive graphs"],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":22,"alternative-id":["10.1145\/2463676.2463703","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2463703","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}