{"id":"https://openalex.org/W3213385095","doi":"https://doi.org/10.1109/icccnt51525.2021.9579935","title":"Heuristics for the Generalized Graph Coloring Problem","display_name":"Heuristics for the Generalized Graph Coloring Problem","publication_year":2021,"publication_date":"2021-07-06","ids":{"openalex":"https://openalex.org/W3213385095","doi":"https://doi.org/10.1109/icccnt51525.2021.9579935","mag":"3213385095"},"language":"en","primary_location":{"id":"doi:10.1109/icccnt51525.2021.9579935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt51525.2021.9579935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055647664","display_name":"Anjeneya Swami Kare","orcid":"https://orcid.org/0000-0003-3644-4802"},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Anjeneya Swami Kare","raw_affiliation_strings":["School of Computer and Information Sciences, University of Hyderabad, Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"School of Computer and Information Sciences, University of Hyderabad, Hyderabad, India","institution_ids":["https://openalex.org/I36893310"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027865363","display_name":"Varun Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Varun Kumar","raw_affiliation_strings":["School of Computer and Information Sciences, University of Hyderabad, Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"School of Computer and Information Sciences, University of Hyderabad, Hyderabad, India","institution_ids":["https://openalex.org/I36893310"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055647664"],"corresponding_institution_ids":["https://openalex.org/I36893310"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20897739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"67","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9508000016212463,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9115999937057495,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6049367189407349},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4974968731403351},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47612816095352173},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4724319875240326},{"id":"https://openalex.org/keywords/soar","display_name":"Soar","score":0.44418686628341675},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4196149706840515},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39039140939712524},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.3425023853778839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34193068742752075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29673606157302856}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6049367189407349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4974968731403351},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47612816095352173},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4724319875240326},{"id":"https://openalex.org/C17305859","wikidata":"https://www.wikidata.org/wiki/Q382944","display_name":"Soar","level":2,"score":0.44418686628341675},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4196149706840515},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39039140939712524},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3425023853778839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34193068742752075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29673606157302856},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccnt51525.2021.9579935","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt51525.2021.9579935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W28882840","https://openalex.org/W130846468","https://openalex.org/W1489945671","https://openalex.org/W1582334898","https://openalex.org/W1757800676","https://openalex.org/W1893264996","https://openalex.org/W2041588219","https://openalex.org/W2052129564","https://openalex.org/W2052435807","https://openalex.org/W2055440347","https://openalex.org/W2064539894","https://openalex.org/W2093373574","https://openalex.org/W2104385491","https://openalex.org/W2125493299","https://openalex.org/W2129888958","https://openalex.org/W2136186184","https://openalex.org/W2150888153","https://openalex.org/W2157775853","https://openalex.org/W2167036627","https://openalex.org/W2168000780","https://openalex.org/W2181847583","https://openalex.org/W2322334644","https://openalex.org/W2585997002","https://openalex.org/W2602721884","https://openalex.org/W2775657349","https://openalex.org/W2790036744","https://openalex.org/W2951134206","https://openalex.org/W3102092102","https://openalex.org/W3105546807","https://openalex.org/W4297816701","https://openalex.org/W6605367296","https://openalex.org/W6637851835","https://openalex.org/W6685750206","https://openalex.org/W6747145278"],"related_works":["https://openalex.org/W2163445345","https://openalex.org/W177098144","https://openalex.org/W1972687012","https://openalex.org/W4250121399","https://openalex.org/W2506478959","https://openalex.org/W2583284593","https://openalex.org/W1578440997","https://openalex.org/W39838470","https://openalex.org/W1652675861","https://openalex.org/W1876769441"],"abstract_inverted_index":{"In":[0,38,211,347],"this":[1,212,348,356],"paper,":[2,213,349],"we":[3,196,214,350],"propose":[4,215],"heuristics":[5,159,180,199,202],"for":[6,153,186,203,224],"the":[7,85,88,101,113,121,134,187,192,204,225,239,245,255],"<tex":[8,29,44,56,73,78,96,104,114,124,140,205,226,274,279,291,306,311,320,326,337],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[9,30,45,57,74,79,97,105,115,125,141,206,227,275,280,292,307,312,321,327,338],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(k,":[10,31,46,80,98,106,116,126,142,207,228,339],"i){-}$</tex>":[11,81,107],"coloring":[12,21,108,137,171,189],"problem,":[13],"which":[14],"is":[15,49,87,130,146,173,194,238,254,266,323,333],"a":[16,42,53,131,235,267,284,334],"generalization":[17,132],"of":[18,28,52,55,67,84,91,120,133,234,241,257,269,272,288,299,304],"classical":[19,135,169,188],"graph":[20,86,136,170],"problem.":[22,138,190,210,231],"We":[23],"also":[24],"explore":[25,355],"an":[26,39,50,352],"application":[27],"i)$</tex>":[32,47,99,117,127,143,208,229,340],"-coloring":[33,48,100,128,144,209,230,341],"problem":[34,109,129,145,172],"to":[35,60,94,111,336,354],"coding":[36],"theory.":[37],"undirected":[40],"graph,":[41],"proper":[43],"assignment":[51],"set":[54,268],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[58],"colors":[59,92],"each":[61],"vertex":[62],"such":[63],"that":[64],"any":[65],"pair":[66],"adjacent":[68],"vertices":[69],"share":[70],"at":[71,289,318],"most":[72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$i$</tex>":[75],"colors.":[76],"The":[77,103,123,139,168,232,247,295],"chromatic":[82],"number":[83,90,119,240,256,298],"minimum":[89],"required":[93],"properly":[95],"graph.":[102,122],"asks":[110],"compute":[112],"-chromatic":[118],"NP-Hard.":[147],"As":[148],"polynomial":[149],"time":[150],"algorithms":[151,157],"unlikely":[152],"NP-Hard":[154],"problems,":[155],"approximation":[156],"or":[158],"produce":[160],"quality":[161],"solution":[162],"on":[163],"many":[164,177],"real":[165],"world":[166],"instances.":[167],"well":[174],"studied":[175],"in":[176,244],"dimensions.":[178],"Many":[179],"and":[181,200,219,282,314,342],"meta-heuristics":[182],"have":[183],"been":[184],"proposed":[185],"Here":[191],"question":[193],"can":[195],"generalize":[197],"these":[198],"meta":[201],"generalized":[216],"greedy":[217],"heuristic":[218,223],"simulated":[220],"annealing":[221],"based":[222],"weight":[233,263,278,301,310,344],"binary":[236,252,264,270,302,345],"vector":[237],"1":[242],"\u2018s":[243],"vector.":[246],"hamming":[248,286,316],"distance":[249,287,317],"between":[250],"two":[251],"vectors":[253,271],"bits":[258],"they":[259],"differ.":[260],"A":[261],"constant":[262,300,343],"code":[265],"length":[273,305],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[276,308],",":[277,309],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$w$</tex>":[281,313],"with":[283,315],"pairwise":[285],"least":[290,319],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d$</tex>":[293,322],".":[294,331],"maximum":[296],"possible":[297],"codes":[303],"denoted":[324],"by":[325],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$A(n,":[328],"d,":[329],"w)$</tex>":[330],"There":[332],"connection":[335],"codes.":[346],"make":[351],"attempt":[353],"connection.":[357]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}