{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:09Z","timestamp":1780994709084,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"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":[[2008,6,9]]},"DOI":"10.1145\/1376616.1376677","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"595-608","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":124,"title":["Efficiently answering reachability queries on very large directed graphs"],"prefix":"10.1145","author":[{"given":"Ruoming","family":"Jin","sequence":"first","affiliation":[{"name":"Kent State University, Kent, OH, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Xiang","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ning","family":"Ruan","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haixun","family":"Wang","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research, Hawthorne, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083651"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_56"},{"key":"e_1_3_2_1_4_1","first-page":"1396","article-title":"On the shortest arborescence of a directed graph","volume":"14","author":"Chu Y. J.","year":"1965","unstructured":"Y. J. Chu and T. H. Liu . On the shortest arborescence of a directed graph . Science Sinica , 14 : 1396 -- 1400 , 1965 . Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396--1400, 1965.","journal-title":"Science Sinica"},{"key":"e_1_3_2_1_5_1","first-page":"937","volume-title":"Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms","author":"Cohen Edith","year":"2002","unstructured":"Edith Cohen , Eran Halperin , Haim Kaplan , and Uri Zwick . Reachability and distance queries via 2-hop labels . In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms , pages 937 -- 946 , 2002 . Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms, pages 937--946, 2002."},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"1990","unstructured":"Thomas H. Cormen , Charles E. Leiserson , and Ronald L. Rivest . Introduction to Algorithms . McGraw Hill , 1990 . Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. McGraw Hill, 1990."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"de Berg Mark","year":"2000","unstructured":"Mark de Berg , M. van Krefeld , M. Overmars , and O. Schwarzkopf . Computational Geometry: Algorithms and Applications . Springer-Verlag , second edition, 2000 . Mark de Berg, M. van Krefeld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, second edition, 2000."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"e_1_3_2_1_10_1","first-page":"101","volume-title":"Network Flow Algorithms","author":"Goldberg A. V.","year":"1990","unstructured":"A. V. Goldberg , E. Tardos , and R. E. Tarjan . Network Flow Algorithms , pages 101 -- 164 . Springer Verlag , 1990 . A. V. Goldberg, E. Tardos, and R. E. Tarjan. Network Flow Algorithms, pages 101--164. Springer Verlag, 1990."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90019-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90032-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2008 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376677","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376616.1376677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:01Z","timestamp":1750255081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":16,"alternative-id":["10.1145\/1376616.1376677","10.1145\/1376616"],"URL":"https:\/\/doi.org\/10.1145\/1376616.1376677","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}