{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:03:16Z","timestamp":1777449796376,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"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":[[2012,5,20]]},"DOI":"10.1145\/2213836.2213888","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"457-468","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Efficient processing of distance queries in large graphs"],"prefix":"10.1145","author":[{"given":"James","family":"Cheng","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiping","family":"Ke","sequence":"additional","affiliation":[{"name":"Institute of High Performance Computing, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shumo","family":"Chu","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carter","family":"Cheng","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873665"},{"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","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796303421"},{"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.1137\/1.9781611972870.1"},{"key":"e_1_3_2_1_6_1","first-page":"859","volume-title":"SODA","author":"Buchsbaum A. L.","year":"2000","unstructured":"A. L. Buchsbaum , M. H. Goldwasser , S. Venkatasubramanian , and J. Westbrook . On external memory graph traversal . In SODA , pages 859 -- 860 , 2000 . A. L. Buchsbaum, M. H. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In SODA, pages 859--860, 2000."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2004.1368125"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Second Edition. The MIT Press and McGraw-Hill Book Company , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_1_12_1","first-page":"228","volume-title":"SODA","author":"Eppstein D.","year":"2001","unstructured":"D. Eppstein and J. Wang . Fast approximation of centrality . In SODA , pages 228 -- 229 , 2001 . D. Eppstein and J. Wang. Fast approximation of centrality. In SODA, pages 228--229, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/829517.830723"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740673"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03456-5_15"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.9"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_40"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_49"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.12"},{"key":"e_1_3_2_1_24_1","first-page":"687","volume-title":"SODA","author":"Munagala K.","year":"1999","unstructured":"K. Munagala and A. G. Ranade . I\/o-complexity of graph algorithms . In SODA , pages 687 -- 694 , 1999 . K. Munagala and A. G. Ranade. I\/o-complexity of graph algorithms. In SODA, pages 687--694, 1999."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.371965"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02476438"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2004.1368126"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90044-8"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(97)00007-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","location":"Scottsdale Arizona USA","acronym":"SIGMOD\/PODS '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213888","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213836.2213888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:01Z","timestamp":1750238461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213888"}},"subtitle":["a vertex cover approach"],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":31,"alternative-id":["10.1145\/2213836.2213888","10.1145\/2213836"],"URL":"https:\/\/doi.org\/10.1145\/2213836.2213888","relation":{},"subject":[],"published":{"date-parts":[[2012,5,20]]},"assertion":[{"value":"2012-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}