{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:54:23Z","timestamp":1753739663466,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T00:00:00Z","timestamp":1332806400000},"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,3,27]]},"DOI":"10.1145\/2247596.2247614","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T13:03:31Z","timestamp":1339419811000},"page":"144-155","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Shortest-path queries for complex networks"],"prefix":"10.1145","author":[{"given":"Takuya","family":"Akiba","sequence":"first","affiliation":[{"name":"The University of Tokyo, Hongo, Bunkyo-ku, Tokyo, Japan"}]},{"given":"Christian","family":"Sommer","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Hitotsubashi, Chiyoda-ku, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2012,3,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90031-0"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1137521"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Robustness and vulnerability of scale-free random graphs","author":"Bollob\u00e1s B.","year":"2003","unstructured":"B. Bollob\u00e1s and O. Riordan . Robustness and vulnerability of scale-free random graphs . Internet Mathematics , 1 , 2003 . B. Bollob\u00e1s and O. Riordan. Robustness and vulnerability of scale-free random graphs. Internet Mathematics, 1, 2003.","journal-title":"Internet Mathematics"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.5468"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010016"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813216"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"e_1_3_2_1_16_1","volume-title":"SODA","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In SODA , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, 2002."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_2_1_19_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2005","unstructured":"R. Diestel . Graph Theory . Springer , August 2005 . R. Diestel. Graph Theory. Springer, August 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027127.2027156"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/05064299X"},{"key":"e_1_3_2_1_22_1","volume-title":"SODA","author":"Flaxman A. D.","year":"2005","unstructured":"A. D. Flaxman , A. M. Frieze , and J. Vera . Adversarial deletion in a scale free random graph process . In SODA , 2005 . A. D. Flaxman, A. M. Frieze, and J. Vera. Adversarial deletion in a scale free random graph process. In SODA, 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.027"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788912"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_6"},{"key":"e_1_3_2_1_27_1","volume-title":"SODA","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: A * search meets graph theory . In SODA , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A * search meets graph theory. In SODA, 2005."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917434"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_3_2_1_31_1","first-page":"28","article-title":"Approximate shortest path queries in graphs using Voronoi duals","volume":"9","author":"Honiden S.","year":"2010","unstructured":"S. Honiden , M. E. Houle , C. Sommer , and M. Wolff . Approximate shortest path queries in graphs using Voronoi duals . Transactions on Computational Science , 9 : 28 -- 53 , 2010 . S. Honiden, M. E. Houle, C. Sommer, and M. Wolff. Approximate shortest path queries in graphs using Voronoi duals. Transactions on Computational Science, 9:28--53, 2010.","journal-title":"Transactions on Computational Science"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/238355.238550"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.70"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_39_1","volume-title":"Random graphs with arbitrary degree distributions and their applications. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 64(2):026118 1--17","author":"Newman M. E. J.","year":"2001","unstructured":"M. E. J. Newman , S. H. Strogatz , and D. J. Watts . Random graphs with arbitrary degree distributions and their applications. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 64(2):026118 1--17 , 2001 . M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 64(2):026118 1--17, 2001."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"e_1_3_2_1_41_1","volume-title":"On the robustness of power-law random graphs in the finite mean, infinite variance region. arXiv:0801.1079","author":"Norros I.","year":"2008","unstructured":"I. Norros and H. Reittu . On the robustness of power-law random graphs in the finite mean, infinite variance region. arXiv:0801.1079 , 2008 . I. Norros and H. Reittu. On the robustness of power-law random graphs in the finite mean, infinite variance region. arXiv:0801.1079, 2008."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076357"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti116"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl181"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150443"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273595"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948223"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.119"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458274"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453934"},{"key":"e_1_3_2_1_58_1","volume-title":"WOSN","author":"Zhao X.","year":"2010","unstructured":"X. Zhao , A. Sala , C. Wilson , H. Zheng , and B. Y. Zhao . Orion: shortest path estimation for large social graphs . In WOSN , 2010 . X. Zhao, A. Sala, C. Wilson, H. Zheng, and B. Y. Zhao. Orion: shortest path estimation for large social graphs. In WOSN, 2010."}],"event":{"name":"EDBT '12: 15th International Conference on Extending Database Technology","acronym":"EDBT '12","location":"Berlin Germany"},"container-title":["Proceedings of the 15th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247614","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2247596.2247614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:03Z","timestamp":1750236543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247614"}},"subtitle":["exploiting low tree-width outside the core"],"short-title":[],"issued":{"date-parts":[[2012,3,27]]},"references-count":57,"alternative-id":["10.1145\/2247596.2247614","10.1145\/2247596"],"URL":"https:\/\/doi.org\/10.1145\/2247596.2247614","relation":{},"subject":[],"published":{"date-parts":[[2012,3,27]]},"assertion":[{"value":"2012-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}