{"id":"https://openalex.org/W4391128829","doi":"https://doi.org/10.1109/ictc58733.2023.10393331","title":"Design of quantum approximate optimization algorithm for graph multi coloring problem","display_name":"Design of quantum approximate optimization algorithm for graph multi coloring problem","publication_year":2023,"publication_date":"2023-10-11","ids":{"openalex":"https://openalex.org/W4391128829","doi":"https://doi.org/10.1109/ictc58733.2023.10393331"},"language":"en","primary_location":{"id":"doi:10.1109/ictc58733.2023.10393331","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ictc58733.2023.10393331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 14th International Conference on Information and Communication Technology Convergence (ICTC)","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/A5102607927","display_name":"Gunsik Min","orcid":null},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Gunsik Min","raw_affiliation_strings":["Korea University,School of Electrical Engineering,Seoul,Korea","School of Electrical Engineering, Korea University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Korea University,School of Electrical Engineering,Seoul,Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055816512","display_name":"Jun Heo","orcid":"https://orcid.org/0000-0002-7230-7875"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jun Heo","raw_affiliation_strings":["Korea University,School of Electrical Engineering,Seoul,Korea","School of Electrical Engineering, Korea University, Seoul, Korea"],"affiliations":[{"raw_affiliation_string":"Korea University,School of Electrical Engineering,Seoul,Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, Korea","institution_ids":["https://openalex.org/I197347611"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102607927"],"corresponding_institution_ids":["https://openalex.org/I197347611"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25203965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"517","last_page":"519"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9854999780654907,"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.9854999780654907,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9800999760627747,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9767000079154968,"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/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.6933135986328125},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6606659889221191},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5997692346572876},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5575488805770874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5519980192184448},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5048769116401672},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4219660460948944},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39534664154052734},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.304302453994751},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3001198172569275},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.28648146986961365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28547602891921997}],"concepts":[{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.6933135986328125},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6606659889221191},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5997692346572876},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5575488805770874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5519980192184448},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5048769116401672},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4219660460948944},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39534664154052734},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.304302453994751},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3001198172569275},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.28648146986961365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28547602891921997},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ictc58733.2023.10393331","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ictc58733.2023.10393331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 14th International Conference on Information and Communication Technology Convergence (ICTC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1568345435","https://openalex.org/W2079035346","https://openalex.org/W2151997344","https://openalex.org/W3106613142","https://openalex.org/W4247919263","https://openalex.org/W6634007516"],"related_works":["https://openalex.org/W2129874988","https://openalex.org/W3196348232","https://openalex.org/W4292387513","https://openalex.org/W2893961859","https://openalex.org/W4388555437","https://openalex.org/W4288077057","https://openalex.org/W3117482915","https://openalex.org/W2474680198","https://openalex.org/W4296193305","https://openalex.org/W1596350596"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,14],"technique":[3],"to":[4,17,55,59,72,146],"solve":[5,32],"the":[6,22,37,46,77,100,106,116,124,129,154,167],"problem":[7,15,94,101,131,160],"of":[8,79,102,118,156,166],"graph":[9,107,110],"multi":[10,158],"coloring,":[11],"which":[12],"is":[13,28,42,53,70],"corresponding":[16],"channel":[18],"allocation":[19],"problem,":[20],"with":[21,108],"quantum":[23,65],"approximate":[24,57],"optimization":[25,34,38,61],"algorithm(QAOA).":[26],"QAOA":[27,168],"an":[29,33],"algorithm":[30,41,97,113,126],"that":[31,127],"problem.":[35],"Among":[36],"problems,":[39],"this":[40,150],"specialized":[43],"as":[44],"solving":[45,157],"quadratic":[47],"unconstrained":[48],"binary":[49],"optimization(QUBO)":[50],"problems.":[51],"It":[52],"designed":[54],"find":[56],"solutions":[58],"combinatorial":[60],"problems":[62],"by":[63,104,140,161],"leveraging":[64],"resources.":[66],"In":[67],"general,":[68],"it":[69],"evaluated":[71],"have":[73],"strengths":[74],"in":[75,144],"optimizing":[76],"base":[78],"optimal":[80],"path":[81],"exploration,":[82],"small":[83],"factor":[84],"resolution,":[85],"and":[86],"mass":[87],"data":[88],"exploration.":[89],"The":[90],"study":[91],"on":[92],"coloring":[93,103,130,159],"using":[95],"digital":[96,125],"has":[98,135],"solved":[99],"replacing":[105],"simple":[109],"or":[111,114],"applying":[112],"reducing":[115,162],"number":[117],"nodes.":[119],"Despite":[120],"these":[121,148],"efforts,":[122],"however,":[123],"solves":[128],"studied":[132],"so":[133],"far":[134],"not":[136],"achieved":[137],"satisfactory":[138],"performance":[139],"some":[141],"limitations.":[142],"Therefore,":[143],"order":[145],"overcome":[147],"limitations,":[149],"paper":[151],"will":[152],"show":[153],"result":[155],"initial":[163],"state":[164],"dimension":[165]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}