{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:15Z","timestamp":1750306755495,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T00:00:00Z","timestamp":1379894400000},"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,9,23]]},"DOI":"10.1145\/2502323.2502331","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"25-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards systematic parallel programming of graph problems via tree decomposition and tree parallelism"],"prefix":"10.1145","author":[{"given":"Qi","family":"Wang","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meixian","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Liu","sequence":"additional","affiliation":[{"name":"The Graduate University for Advanced Studies, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247614"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/3-540-45995-2_52","volume-title":"LATIN 2002: Theoretical Informatics","author":"Alber J.","year":"2002","unstructured":"J. Alber and R. Niedermeier . Improved tree decomposition based algorithms for domination-like problems . In LATIN 2002: Theoretical Informatics , pages 613 -- 627 . Springer , 2002 . J. Alber and R. Niedermeier. Improved tree decomposition based algorithms for domination-like problems. In LATIN 2002: Theoretical Informatics, pages 613--627. Springer, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0608024"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.09.007"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Functional Programming using Haskell","author":"Bird R.","year":"1998","unstructured":"R. Bird . Introduction to Functional Programming using Haskell . Prentice Hall PTR , 2 edition, May 1998 . ISBN 0134843460. R. Bird. Introduction to Functional Programming using Haskell. Prentice Hall PTR, 2 edition, May 1998. ISBN 0134843460."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/42675.42676"},{"key":"e_1_3_2_1_8_1","volume-title":"International Journal on Semantic Web and Information Systems (IJSWIS) , 5(3):1--22","author":"Bizer C.","year":"2009","unstructured":"C. Bizer , T. Heath , and T. Berners-Lee . Linked Data - The Story So Far . International Journal on Semantic Web and Information Systems (IJSWIS) , 5(3):1--22 , Mar 2009 . ISSN 1552-6283. C. Bizer, T. Heath, and T. Berners-Lee. Linked Data - The Story So Far. International Journal on Semantic Web and Information Systems (IJSWIS) , 5(3):1--22, Mar 2009. ISSN 1552-6283."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90013-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm037"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872726.806984"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2012.04.201"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_13"},{"key":"e_1_3_2_1_18_1","volume-title":"Computing the treewidth of graphs","author":"Fu Y.","year":"2011","unstructured":"Y. Fu . Computing the treewidth of graphs , 2011 . Y. Fu. Computing the treewidth of graphs, 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800001908"},{"key":"e_1_3_2_1_20_1","first-page":"17","volume-title":"OSDI'12","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . PowerGraph: distributed graph-parallel computation on natural graphs . OSDI'12 , pages 17 -- 30 , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: distributed graph-parallel computation on natural graphs. OSDI'12, pages 17--30, 2012."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646680.702325"},{"key":"e_1_3_2_1_23_1","volume-title":"Branch and tree decomposition techniques for discrete optimization","author":"Hicks I. V.","year":"2005","unstructured":"I. V. Hicks , A. M. C. A. Koster , and Branch and tree decomposition techniques for discrete optimization , 2005 . I. V. Hicks, A. M. C. A. Koster, and et al. Branch and tree decomposition techniques for discrete optimization, 2005."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002864"},{"key":"e_1_3_2_1_25_1","volume-title":"A practicable framework for tree reductions under distributed memory environments. Technical report","author":"Kakehi K.","year":"2006","unstructured":"K. Kakehi , K. Matsuzaki , K. Emoto , and Z. Hu . A practicable framework for tree reductions under distributed memory environments. Technical report , 2006 . K. Kakehi, K. Matsuzaki, K. Emoto, and Z. Hu. A practicable framework for tree reductions under distributed memory environments. Technical report, 2006."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72586-2_88"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_1_28_1","unstructured":"A. Koster. Frequency assignment - models and algorithms 1999.  A. Koster. Frequency assignment - models and algorithms 1999."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_30_1","volume-title":"Local computations with probabilities on graphical structures and their application to expert systems (with discussion). Journal of the Royal Statistical Society series B, 50: 157--224","author":"Lauritzen S.","year":"1988","unstructured":"S. Lauritzen and D. J. Spiegelhalter . Local computations with probabilities on graphical structures and their application to expert systems (with discussion). Journal of the Royal Statistical Society series B, 50: 157--224 , 1988 . S. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems (with discussion). Journal of the Royal Statistical Society series B, 50: 157--224, 1988."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033408.2033414"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of John von Neumann PhD Students Conference. Citeseer","author":"Marx D.","year":"2004","unstructured":"D. Marx . Graph coloring problems and their applications in scheduling . In Proceedings of John von Neumann PhD Students Conference. Citeseer , 2004 . D. Marx. Graph coloring problems and their applications in scheduling. In Proceedings of John von Neumann PhD Students Conference. Citeseer, 2004."},{"key":"e_1_3_2_1_35_1","first-page":"258","volume-title":"Implementation of parallel tree skeletons on distributed systems. In proceeedings of the third Asina workshop on Programming Languages and Systems","author":"Matsuzaki K.","year":"2002","unstructured":"K. Matsuzaki , Z. Hu , and M. Takeichi . Implementation of parallel tree skeletons on distributed systems. In proceeedings of the third Asina workshop on Programming Languages and Systems , pages 258 -- 271 , 2002 . K. Matsuzaki, Z. Hu, and M. Takeichi. Implementation of parallel tree skeletons on distributed systems. In proceeedings of the third Asina workshop on Programming Languages and Systems, pages 258--271, 2002."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45209-6_108"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626405002246"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.06.002"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148116"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.43"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480905"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944716"},{"key":"e_1_3_2_1_43_1","first-page":"115","volume-title":"Synthesis of Parallel Algorithms","author":"Reid-Miller M.","year":"1993","unstructured":"M. Reid-Miller , G. L. Miller , and F. Modugno . List ranking and parallel tree contraction . In J. Reif, editor, Synthesis of Parallel Algorithms , chapter 3, pages 115 -- 194 . Morgan Kaufmann , 1993 . M. Reid-Miller, G. L. Miller, and F. Modugno. List ranking and parallel tree contraction. In J. Reif, editor, Synthesis of Parallel Algorithms, chapter 3, pages 115--194. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_1_45_1","first-page":"42","article-title":"Structured parallel computation in structured documents","volume":"3","author":"Skillicorn D. B.","year":"1995","unstructured":"D. B. Skillicorn . Structured parallel computation in structured documents . Journal of Universal Computer Science , 3 : 42 -- 68 , 1995 . D. B. Skillicorn. Structured parallel computation in structured documents. Journal of Universal Computer Science, 3:42--68, 1995.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/640186.640195"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2697"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_1_50_1","volume-title":"The Definitive Guide","author":"White T.","year":"2009","unstructured":"T. White . Hadoop : The Definitive Guide . O'Reilly Media, Inc. , 1st edition, 2009 . ISBN 0596521979, 9780596521974 T. White. Hadoop: The Definitive Guide. O'Reilly Media, Inc., 1st edition, 2009. ISBN 0596521979, 9780596521974"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Boston Massachusetts USA","acronym":"ICFP'13"},"container-title":["Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502323.2502331","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2502323.2502331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:35Z","timestamp":1750231715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502323.2502331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,23]]},"references-count":48,"alternative-id":["10.1145\/2502323.2502331","10.1145\/2502323"],"URL":"https:\/\/doi.org\/10.1145\/2502323.2502331","relation":{},"subject":[],"published":{"date-parts":[[2013,9,23]]},"assertion":[{"value":"2013-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}