{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:30:08Z","timestamp":1781386208376,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,9,16]],"date-time":"2006-09-16T00:00:00Z","timestamp":1158364800000},"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":[[2006,9,16]]},"DOI":"10.1145\/1152154.1152189","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"222-232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Program generation for the all-pairs shortest path problem"],"prefix":"10.1145","author":[{"given":"Sung-Chul","family":"Han","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franz","family":"Franchetti","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"P\u00fcschel","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,9,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840311"},{"key":"e_1_3_2_1_2_1","volume-title":"Data Networks","author":"Bertsekas D.","year":"1992","unstructured":"D. Bertsekas and R. Gallager . Data Networks . Prentice Hall , Upper Saddle River, 1992 . D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, Upper Saddle River, 1992."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055531.1055532"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780567"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840848"},{"key":"e_1_3_2_1_6_1","volume-title":"The Art and Theory of Dynamic Programming","author":"Dreyfus S. E.","year":"1977","unstructured":"S. E. Dreyfus and A. M. Law . The Art and Theory of Dynamic Programming . Academic Press , New York, NY , 1977 . S. E. Dreyfus and A. M. Law. The Art and Theory of Dynamic Programming. Academic Press, New York, NY, 1977."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103963.1103968"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301661"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_3_2_1_10_1","first-page":"156","volume-title":"SODA '05: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: A search meets graph theory . In SODA '05: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms , pages 156 -- 165 , Philadelphia, PA, USA , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In SODA '05: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pages 156--165, Philadelphia, PA, USA, 2005."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/504210.504213"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041296"},{"key":"e_1_3_2_1_13_1","unstructured":"Intel Corporation. Intel C++ compiler documentation 2005. Document number 304968-005.  Intel Corporation. Intel C++ compiler documentation 2005. Document number 304968-005."},{"key":"e_1_3_2_1_14_1","unstructured":"R. Johnsonbaugh and M. Kalin. A graph generation package. www.depaul.edu\/~rjohnson\/source.  R. Johnsonbaugh and M. Kalin. A graph generation package. www.depaul.edu\/~rjohnson\/source."},{"key":"e_1_3_2_1_15_1","volume-title":"OSPF version 2. RFC","author":"Moy J.","year":"1998","unstructured":"J. Moy . OSPF version 2. RFC 2328, April 1998 . J. Moy. OSPF version 2. RFC 2328, April 1998."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.44"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840306"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/996546.996553"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00087-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840444"}],"event":{"name":"PACT06: 2006 International Conference on Parallel Architectures and Compilation Techniques","location":"Seattle Washington USA","acronym":"PACT06","sponsor":["ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 15th international conference on Parallel architectures and compilation techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1152154.1152189","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1152154.1152189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:44Z","timestamp":1750262864000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1152154.1152189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,16]]},"references-count":20,"alternative-id":["10.1145\/1152154.1152189","10.1145\/1152154"],"URL":"https:\/\/doi.org\/10.1145\/1152154.1152189","relation":{},"subject":[],"published":{"date-parts":[[2006,9,16]]},"assertion":[{"value":"2006-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}