{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:51:48Z","timestamp":1725774708798},"reference-count":41,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icde.2016.7498232","type":"proceedings-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T11:36:34Z","timestamp":1466854594000},"page":"97-108","source":"Crossref","is-referenced-by-count":10,"title":["VColor: A practical vertex-cut based approach for coloring large graphs"],"prefix":"10.1109","author":[{"given":"Yun","family":"Peng","sequence":"first","affiliation":[]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Ruzhi","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xiaohui","family":"Yu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.37"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.04.002"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.3.378"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(87)80148-0"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.07.016"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2015.7069325"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.06.007"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595913500188"},{"key":"ref10","first-page":"1077","article-title":"The graph coloring problem: A bibliographic survey","author":"pardalos","year":"1999","journal-title":"Handbook of Combinatorial Optimization"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247564"},{"year":"0","key":"ref11","article-title":"PubChem"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2316818"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2013.42"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597042"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.03.002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.05.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132573"},{"year":"0","key":"ref19","article-title":"jgrapht"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.07.017"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90061-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125407"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/989393.989403"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90246-6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.01.015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30504-7_20"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"},{"key":"ref2","first-page":"258","article-title":"Application of the graph coloring algorithm to the frequency assignment problem","author":"park","year":"1996","journal-title":"Journal of the Operations Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"ref1","first-page":"1","author":"ingrid","year":"2005","journal-title":"Nucleic acid sequence design as a graph colouring problem"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"ref22","first-page":"277","author":"husfeldt","year":"2015","journal-title":"Graph colouring algorithms ser Encyclopedia of Mathematics and its Applications"},{"year":"0","key":"ref21","article-title":"SNAP"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79305-2_11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260788"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.05.014"},{"key":"ref26","first-page":"226","article-title":"Coloration neighborhood structures for general graph coloring","author":"morgenstern","year":"1990","journal-title":"ser SODA"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.03.022"}],"event":{"name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2016,5,16]]},"location":"Helsinki, Finland","end":{"date-parts":[[2016,5,20]]}},"container-title":["2016 IEEE 32nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7491900\/7498210\/07498232.pdf?arnumber=7498232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,9,30]],"date-time":"2016-09-30T00:21:45Z","timestamp":1475194905000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7498232\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/icde.2016.7498232","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}