{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T21:35:04Z","timestamp":1775856904519,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1109\/icccnt51525.2021.9579935","type":"proceedings-article","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T15:29:48Z","timestamp":1635953388000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics for the Generalized Graph Coloring Problem"],"prefix":"10.1109","author":[{"given":"Anjeneya Swami","family":"Kare","sequence":"first","affiliation":[]},{"given":"Varun","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125407"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"},{"key":"ref12","article-title":"Simulated annealing algorithm for graph coloring","author":"kose","year":"2017","journal-title":"CoRR vol abs\/1712 00709"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.07.047"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90027-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.59932"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.623163"},{"key":"ref17","article-title":"Six new constant weight binary codes","volume":"67","author":"aw","year":"2003","journal-title":"Ars Comb"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851748"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.37236\/1162"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854800"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53007-9_25"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2018.02.017"},{"key":"ref3","first-page":"167","article-title":"A generalization of the graph coloring problem","volume":"8","author":"d\u00edaz","year":"1999","journal-title":"The Operations Investigation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.05.022"},{"key":"ref29","year":"0","journal-title":"Graph Coloring Instances"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026\/14"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"ref2","article-title":"On the (k, i)-coloring of cacti and complete graphs","author":"bonomo","year":"2014","journal-title":"Ars Combinatoria"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.07.012"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.08.018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2027491"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050922"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040964"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"417","DOI":"10.3934\/amc.2011.5.417","article-title":"Some new distance-4 constant weight codes","volume":"5","author":"andries","year":"2011","journal-title":"Advances in Mathematics of Communications"},{"key":"ref23","article-title":"Improved linear programming bounds on sizes of constant-weight codes","author":"kang","year":"2011","journal-title":"ArXiv vol abs\/1108 5104"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277714"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.37236\/2702"}],"event":{"name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","location":"Kharagpur, India","start":{"date-parts":[[2021,7,6]]},"end":{"date-parts":[[2021,7,8]]}},"container-title":["2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9579467\/9579470\/09579935.pdf?arnumber=9579935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:55:47Z","timestamp":1652187347000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9579935\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icccnt51525.2021.9579935","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]}}}