{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:25:22Z","timestamp":1768029922922,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1406304"],"award-info":[{"award-number":["1406304"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,19]]},"DOI":"10.1145\/3332466.3374519","type":"proceedings-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:13:53Z","timestamp":1582139633000},"page":"262-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Increasing the parallelism of graph coloring via shortcutting"],"prefix":"10.1145","author":[{"given":"Ghadeer","family":"Alabandi","sequence":"first","affiliation":[{"name":"Texas State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evan","family":"Powers","sequence":"additional","affiliation":[{"name":"Texas State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Burtscher","sequence":"additional","affiliation":[{"name":"Texas State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Boost https:\/\/www.boost.org\/doc\/libs\/1_63_0\/libs\/graph_parallel\/doc\/html\/index.html last accessed on 12\/28\/2019.  Boost https:\/\/www.boost.org\/doc\/libs\/1_63_0\/libs\/graph_parallel\/doc\/html\/index.html last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2012.07.001"},{"key":"e_1_3_2_1_3_1","unstructured":"Chen and Li https:\/\/github.com\/chenxuhao\/csrcolor last accessed on 12\/28\/2019.  Chen and Li https:\/\/github.com\/chenxuhao\/csrcolor last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4064"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Efficient graph matching and coloring on the GPU","author":"Cohen Jonathan","year":"2012","unstructured":"Cohen , Jonathan and Patrice Castonguay . \" Efficient graph matching and coloring on the GPU .\" In GPU Technology Conference , pp. 1 -- 10 . 2012 . Cohen, Jonathan and Patrice Castonguay. \"Efficient graph matching and coloring on the GPU.\" In GPU Technology Conference, pp. 1--10. 2012.","journal-title":"GPU Technology Conference"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595295349"},{"key":"e_1_3_2_1_7_1","unstructured":"ColPack Combinatorial Scientific Computing and Petascale Simulations https:\/\/github.com\/CSCsw\/ColPack last accessed on 12\/28\/2019.  ColPack Combinatorial Scientific Computing and Petascale Simulations https:\/\/github.com\/CSCsw\/ColPack last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_8_1","unstructured":"Cusparse library. NVIDIA Corporation Santa Clara California. 2014.  Cusparse library. NVIDIA Corporation Santa Clara California. 2014."},{"key":"e_1_3_2_1_9_1","unstructured":"Dalton S. and N. Bell. \"CUSP: A C++ templated sparse matrix library.\" http:\/\/cusplibrary.github.io last accessed on 12\/28\/2019.  Dalton S. and N. Bell. \"CUSP: A C++ templated sparse matrix library.\" http:\/\/cusplibrary.github.io last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_10_1","unstructured":"DIMACS Center for Discrete Mathematics and Theoretical Computer Science http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml last accessed on 12\/28\/2019.  DIMACS Center for Discrete Mathematics and Theoretical Computer Science http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_11_1","unstructured":"ECL-GC Texas State University https:\/\/cs.txstate.edu\/~burtscher\/research\/ECL-GC\/ last accessed on 12\/28\/2019.  ECL-GC Texas State University https:\/\/cs.txstate.edu\/~burtscher\/research\/ECL-GC\/ last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_12_1","unstructured":"Galois ISS - The University of Texas at Austin https:\/\/iss.oden.utexas.edu\/?p=projects\/galois last accessed on 12\/28\/2019.  Galois ISS - The University of Texas at Austin https:\/\/iss.oden.utexas.edu\/?p=projects\/galois last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_13_1","volume-title":"\"Computers and Intractability","author":"Garey Michael R","year":"2002","unstructured":"Garey , Michael R . , and David S . Johnson . \"Computers and Intractability \", vol. 29 . W. H. Freeman and Company , New York ( 2002 ): 1--99. Garey, Michael R., and David S. Johnson. \"Computers and Intractability\", vol. 29. W. H. Freeman and Company, New York (2002): 1--99."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513109.2513110"},{"key":"e_1_3_2_1_15_1","unstructured":"Grappolo the Grappolo graph toolkit https:\/\/github.com\/luhowardmark\/GrappoloTK last accessed on 12\/28\/2019.  Grappolo the Grappolo graph toolkit https:\/\/github.com\/luhowardmark\/GrappoloTK last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038037.1941597"},{"key":"e_1_3_2_1_17_1","volume-title":"ACM","author":"Hasenplaugh William","year":"2014","unstructured":"Hasenplaugh , William , Tim Kaler , Tao B. Schardl , and Charles E . Leiserson . \"Ordering heuristics for parallel graph coloring.\" In 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 166--177 . ACM , 2014 . Hasenplaugh, William, Tim Kaler, Tao B. Schardl, and Charles E. Leiserson. \"Ordering heuristics for parallel graph coloring.\" In 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 166--177. ACM, 2014."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1994.288257"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0914041"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Luby Michael. \"A simple parallel algorithm for the maximal independent set problem.\" SIAM journal on computing 15 no. 4 (1986):  1036--1053.  Luby Michael. \"A simple parallel algorithm for the maximal independent set problem.\" SIAM journal on computing 15 no. 4 (1986): 1036--1053.","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_1_21_1","volume-title":"ACM","author":"Mart\u00ednez-Bazan Norbert","year":"2012","unstructured":"Mart\u00ednez-Bazan , Norbert , M. \u00c1ngel \u00c1guila-Lorente , Victor Munt\u00e9s-Mulero , David Dominguez-Sal , Sergio G\u00f3mez-Villamor , and Josep- L. Larriba-Pey. \" Efficient graph management based on bitmap indices.\" In 16th International Database Engineering & Applications Symposium, pp. 110--119 . ACM , 2012 . Mart\u00ednez-Bazan, Norbert, M. \u00c1ngel \u00c1guila-Lorente, Victor Munt\u00e9s-Mulero, David Dominguez-Sal, Sergio G\u00f3mez-Villamor, and Josep-L. Larriba-Pey. \"Efficient graph management based on bitmap indices.\" In 16th International Database Engineering & Applications Symposium, pp. 110--119. ACM, 2012."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-1-4832-3187-7.50015-5","volume-title":"\"Graph coloring algorithms.\" In Graph theory and computing","author":"Matula David W","year":"1972","unstructured":"Matula , David W . , George Marble , and Joel D. Isaacson . \"Graph coloring algorithms.\" In Graph theory and computing , pp. 109 -- 122 . Academic Press , 1972 . Matula, David W., George Marble, and Joel D. Isaacson. \"Graph coloring algorithms.\" In Graph theory and computing, pp. 109--122. Academic Press, 1972."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"e_1_3_2_1_24_1","volume-title":"IEEE","author":"Nasre Rupesh","year":"2013","unstructured":"Nasre , Rupesh , Martin Burtscher , and Keshav Pingali . \"Data-driven versus topology-driven irregular computations on GPUs.\" In 2013 IEEE International Symposium on Parallel and Distributed Processing, pp. 463--474 . IEEE , 2013 . Nasre, Rupesh, Martin Burtscher, and Keshav Pingali. \"Data-driven versus topology-driven irregular computations on GPUs.\" In 2013 IEEE International Symposium on Parallel and Distributed Processing, pp. 463--474. IEEE, 2013."},{"key":"e_1_3_2_1_25_1","unstructured":"Naumov Maxim Patrice Castonguay and Jonathan Cohen. \"Parallel graph coloring with applications to the incomplete-LU factorization on the GPU.\" Nvidia White Paper 2015.  Naumov Maxim Patrice Castonguay and Jonathan Cohen. \"Parallel graph coloring with applications to the incomplete-LU factorization on the GPU.\" Nvidia White Paper 2015."},{"key":"e_1_3_2_1_26_1","volume-title":"user guide and reference manual.\" Addison-Wesley","author":"Siek Jeremy","year":"2002","unstructured":"Siek , Jeremy , Andrew Lumsdaine , and Lie-Quan Lee . \"The boost graph library : user guide and reference manual.\" Addison-Wesley , 2002 . Siek, Jeremy, Andrew Lumsdaine, and Lie-Quan Lee. \"The boost graph library: user guide and reference manual.\" Addison-Wesley, 2002."},{"key":"e_1_3_2_1_27_1","volume-title":"ACM","author":"Singhal Nandini","year":"2017","unstructured":"Singhal , Nandini , Sathya Peri , and Subrahmanyam Kalyanasundaram . \" Practical multi-threaded graph coloring algorithms for shared memory architecture.\" In 18th International Conference on Distributed Computing and Networking, p. 44 . ACM , 2017 . Singhal, Nandini, Sathya Peri, and Subrahmanyam Kalyanasundaram. \"Practical multi-threaded graph coloring algorithms for shared memory architecture.\" In 18th International Conference on Distributed Computing and Networking, p. 44. ACM, 2017."},{"key":"e_1_3_2_1_28_1","unstructured":"SNAP Stanford Large Network Dataset Collection https:\/\/snap.stanford.edu\/data\/ last accessed on 12\/28\/2019.  SNAP Stanford Large Network Dataset Collection https:\/\/snap.stanford.edu\/data\/ last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_29_1","unstructured":"SuiteSparse Matrix Collection https:\/\/sparse.tamu.edu\/ last accessed on 12\/28\/2019.  SuiteSparse Matrix Collection https:\/\/sparse.tamu.edu\/ last accessed on 12\/28\/2019."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"}],"event":{"name":"PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Diego California","acronym":"PPoPP '20","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374519","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3332466.3374519","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3332466.3374519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:37Z","timestamp":1750204477000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":30,"alternative-id":["10.1145\/3332466.3374519","10.1145\/3332466"],"URL":"https:\/\/doi.org\/10.1145\/3332466.3374519","relation":{},"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"2020-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}