{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T13:22:50Z","timestamp":1783948970675,"version":"3.55.0"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Fujian Province Middle-Aged and Young Teachers Educational Research Project","award":["JAT220492"],"award-info":[{"award-number":["JAT220492"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3439352","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T18:18:37Z","timestamp":1722968317000},"page":"168000-168009","source":"Crossref","is-referenced-by-count":3,"title":["Graph Coloring Algorithm Based on Minimal Cost Graph Neural Network"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1943-9862","authenticated-orcid":false,"given":"Ming","family":"Gao","sequence":"first","affiliation":[{"name":"School of Computing and Information Science, Fuzhou Institute of Technology, Fuzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Hu","sequence":"additional","affiliation":[{"name":"College of Information and Intelligent Transportation, Fujian Chuanzheng Communications College, Fuzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Elements of Adaptive Testing","author":"Johnson","year":"2019"},{"key":"ref2","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018","journal-title":"arXiv:1806.01261"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3332373"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101324"},{"issue":"4","key":"ref5","first-page":"329","article-title":"Hybrid evolutionary algorithms for graph coloring","volume":"10","author":"Galinier","year":"2006","journal-title":"J. Combinat. Optim."},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.06.020"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3071274"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3542609"},{"key":"ref9","first-page":"23341","article-title":"How powerful are spectral graph neural networks","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","volume":"162","author":"Wang"},{"key":"ref10","article-title":"Rethinking graph neural networks for the graph coloring problem","author":"Li","year":"2022","journal-title":"arXiv:2208.06975"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/9781316672815"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_16"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2014.6952484"},{"key":"ref14","article-title":"Evolutionary algorithm for graph coloring problem","author":"Islam","year":"2021","journal-title":"arXiv:2111.09743"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539177"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90066-X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462968"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570472"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1561\/2200000096"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.35833\/MPCE.2021.000058"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16523"},{"key":"ref23","first-page":"21076","article-title":"Rethinking graph neural networks for anomaly detection","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","volume":"162","author":"Tang"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1140\/epjc\/s10052-020-8148-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02973-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2020.3015157"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1155\/2023\/8342104"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.06.012"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-019-01190-4"},{"key":"ref31","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Velickovic"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3072345"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3154755"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.08.021"},{"key":"ref35","article-title":"How attentive are graph attention networks?","author":"Brody","year":"2021","journal-title":"arXiv:2105.14491"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02214-8"},{"key":"ref37","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2004.01.189"},{"key":"ref39","article-title":"Provably powerful graph networks","author":"Maron","year":"2019","journal-title":"arXiv:1905.11136"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3579827"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3011799"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3221820"},{"key":"ref46","first-page":"1","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref47","article-title":"ChebNet: Efficient and stable constructions of deep neural networks with rectified power units via Chebyshev approximations","author":"Tang","year":"2019","journal-title":"arXiv:1911.05467"},{"key":"ref48","article-title":"Convolutional neural networks on graphs with Chebyshev approximation, revisited","author":"He","year":"2022","journal-title":"arXiv:2202.03580"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3105446"},{"key":"ref50","article-title":"On the closest string and substring problems","author":"Li","year":"2000","journal-title":"arXiv:cs\/0002012"},{"key":"ref51","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kool"},{"key":"ref52","article-title":"Learning combinatorial optimization algorithms over graphs","author":"Dai","year":"2017","journal-title":"arXiv:1704.01665"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2019.00125"},{"key":"ref54","article-title":"A deep learning guided memetic framework for graph coloring problems","author":"Goudet","year":"2021","journal-title":"arXiv:2109.05948"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICET56601.2022.10004654"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-024-01355-w"},{"key":"ref57","article-title":"A graph neural network with negative message passing for graph coloring","author":"Wang","year":"2023","journal-title":"arXiv:2301.11164"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.043131"},{"issue":"290","key":"ref59","first-page":"18","article-title":"On random graphs I","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref61","first-page":"539","article-title":"Learning to discover social circles in ego networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Leskovec"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935863"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2010\/12\/p12037"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25730-3"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.3.378"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref71","article-title":"Graph attention networks","author":"Velickovic","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref72","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104850"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10623632.pdf?arnumber=10623632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:15:51Z","timestamp":1732666551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10623632\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":74,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3439352","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}