{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T01:35:57Z","timestamp":1775698557167,"version":"3.50.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2325416"],"award-info":[{"award-number":["2325416"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2325417"],"award-info":[{"award-number":["2325417"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tnse.2023.3337750","type":"journal-article","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T18:57:50Z","timestamp":1701716270000},"page":"2110-2123","source":"Crossref","is-referenced-by-count":5,"title":["A Graph Machine Learning Framework to Compute Zero Forcing Sets in Graphs"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8303-1114","authenticated-orcid":false,"given":"Obaid Ullah","family":"Ahmad","sequence":"first","affiliation":[{"name":"Electrical Engineering Department, The University of Texas at Dallas, Richardson, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6961-0961","authenticated-orcid":false,"given":"Mudassir","family":"Shabbir","sequence":"additional","affiliation":[{"name":"Computer Science Department, Vanderbilt University, Nashville, TN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9013-1463","authenticated-orcid":false,"given":"Waseem","family":"Abbas","sequence":"additional","affiliation":[{"name":"Systems Engineering Department, The University of Texas at Dallas, Richardson, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0923-6293","authenticated-orcid":false,"given":"Xenofon","family":"Koutsoukos","sequence":"additional","affiliation":[{"name":"Computer Science Department, Vanderbilt University, Nashville, TN, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000032574.01332.98"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498232"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30165-5_30"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2014.6921552"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749450"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2250075"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.09.030"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2308619"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2762620"},{"key":"ref12","article-title":"Hardness results and approximation algorithms for some problems on graphs","author":"Aazami","year":"2008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/ACC53348.2022.9867655"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414563"},{"key":"ref15","article-title":"Neural combinatorial optimization beyond the TSP: Existing architectures under-represent graph structure","volume-title":"Proc. AAAI Workshop Graphs More Complex Structures Learn. Reasoning","author":"Boffa","year":"2022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/595"},{"key":"ref17","first-page":"1","article-title":"Whats wrong with deep learning in tree search for combinatorial optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bther","year":"2022"},{"key":"ref18","first-page":"1","article-title":"How neural networks extrapolate: From feedforward to graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","year":"2020"},{"key":"ref19","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"Joshi","year":"2019"},{"key":"ref20","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/595"},{"key":"ref22","first-page":"1","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2019","journal-title":"Proc. Int. Conf. Learn. Representations"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107526"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2007.10.009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.06.025"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2013.6580798"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.03.011"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.1219"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.37236\/8097"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.03.031"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2020.03.031"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.99.100501"},{"key":"ref33","article-title":"Minimum rank library. Sage programs for calculating bounds on the minimum rank of a graph, and for computing zero forcing parameters","author":"Butler","year":"2014"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.1032"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.03.027"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7040261"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/3514061.3514070"},{"key":"ref38","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","volume":"2","author":"Vinyals","year":"2015"},{"key":"ref39","first-page":"537","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Li","year":"2018"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref41","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref42","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","author":"Morris","year":"2020"},{"key":"ref43","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2016"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6488902\/10443744\/10339870-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/10443744\/10339870.pdf?arnumber=10339870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T21:06:27Z","timestamp":1710363987000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10339870\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2023.3337750","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}