{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:58:20Z","timestamp":1729673900090,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1109\/coginf.2011.6016178","type":"proceedings-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T18:40:43Z","timestamp":1316544043000},"page":"438-443","source":"Crossref","is-referenced-by-count":1,"title":["Resolution of the general T-coloring problem using an MBO based algorithm"],"prefix":"10.1109","author":[{"given":"Nouioua","family":"Leila","sequence":"first","affiliation":[]},{"given":"Bessedik","family":"Malika","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023000"},{"key":"2","article-title":"Two hybrid ant algorithms for the general T-Coloring Problem","author":"mahmoudi","year":"2010","journal-title":"International Journal of Bio-Informatic Computation"},{"key":"10","article-title":"A honey bee-mating approach for cluster analysis","author":"fathian","year":"2007","journal-title":"Int J Adv Manuf Technol"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11899"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90603-D"},{"key":"6","first-page":"286","article-title":"Greedy algorithms for Tcolorings of complete graphs and the meaningfulness of conclusions about them","volume":"16","author":"cozzens","year":"1991","journal-title":"J Combin Inform System Sci"},{"journal-title":"Tabu Search for Graph Coloring TColorings and Set T -Colorings","year":"1998","author":"hao","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1158"},{"key":"9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(95)00225-L","article-title":"T-graphs and the channel assignment problem","volume":"161","author":"liu","year":"1996","journal-title":"Discrete Math"},{"key":"8","article-title":"On a conjerture of T-colorings","volume":"103","author":"liu","year":"1994","journal-title":"Congr Numer"},{"key":"11","first-page":"212","article-title":"Using Bees to Solve a Data-Mining Problem Expressed as a Max-Sat One","volume":"3562","author":"benatchba","year":"2005","journal-title":"LNCS"},{"key":"12","article-title":"MBO: Marriage in Honey Bees Optimization, A Haplometrosis Polygynous Swarming Approach","author":"hussein","year":"0","journal-title":"The Congress on Evolutionary Computation CEC200 I Seoul Korea May2001"}],"event":{"name":"Cognitive Computing (ICCI-CC)","start":{"date-parts":[[2011,8,18]]},"location":"Banff, AB, Canada","end":{"date-parts":[[2011,8,20]]}},"container-title":["IEEE 10th International Conference on Cognitive Informatics and Cognitive Computing (ICCI-CC'11)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6005105\/6016112\/06016178.pdf?arnumber=6016178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T06:40:33Z","timestamp":1497940833000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6016178\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/coginf.2011.6016178","relation":{},"subject":[],"published":{"date-parts":[[2011,8]]}}}