{"id":"https://openalex.org/W4294690626","doi":"https://doi.org/10.23919/acc53348.2022.9867655","title":"Leader Selection for Strong Structural Controllability in Networks using Zero Forcing Sets","display_name":"Leader Selection for Strong Structural Controllability in Networks using Zero Forcing Sets","publication_year":2022,"publication_date":"2022-06-08","ids":{"openalex":"https://openalex.org/W4294690626","doi":"https://doi.org/10.23919/acc53348.2022.9867655"},"language":"en","primary_location":{"id":"doi:10.23919/acc53348.2022.9867655","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc53348.2022.9867655","pdf_url":null,"source":{"id":"https://openalex.org/S4363607732","display_name":"2022 American Control Conference (ACC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 American Control Conference (ACC)","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/A5041744190","display_name":"Waseem Abbas","orcid":"https://orcid.org/0000-0002-9013-1463"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Waseem Abbas","raw_affiliation_strings":["The University of Texas,Systems Engineering Department,Dallas,Richardson,TX","Systems Engineering Department, The University of Texas, Dallas, Richardson, TX"],"affiliations":[{"raw_affiliation_string":"The University of Texas,Systems Engineering Department,Dallas,Richardson,TX","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Systems Engineering Department, The University of Texas, Dallas, Richardson, TX","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058924014","display_name":"Mudassir Shabbir","orcid":"https://orcid.org/0000-0002-6961-0961"},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mudassir Shabbir","raw_affiliation_strings":["Vanderbilt University,The Electrical Engineering and Computer Science Department,Nashville,TN","The Electrical Engineering and Computer Science Department, Vanderbilt University, Nashville, TN"],"affiliations":[{"raw_affiliation_string":"Vanderbilt University,The Electrical Engineering and Computer Science Department,Nashville,TN","institution_ids":["https://openalex.org/I200719446"]},{"raw_affiliation_string":"The Electrical Engineering and Computer Science Department, Vanderbilt University, Nashville, TN","institution_ids":["https://openalex.org/I200719446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041762786","display_name":"Yasin Yaz\u0131c\u0131o\u011flu","orcid":"https://orcid.org/0000-0001-6957-6831"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yasin Yazicioglu","raw_affiliation_strings":["The University of Minnesota,The Department of Electrical and Computer Engineering,Minneapolis,MN,USA","The Department of Electrical and Computer Engineering, The University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"The University of Minnesota,The Department of Electrical and Computer Engineering,Minneapolis,MN,USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"The Department of Electrical and Computer Engineering, The University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023397404","display_name":"Xenofon Koutsoukos","orcid":"https://orcid.org/0000-0002-0923-6293"},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xenofon Koutsoukos","raw_affiliation_strings":["Vanderbilt University,The Electrical Engineering and Computer Science Department,Nashville,TN","The Electrical Engineering and Computer Science Department, Vanderbilt University, Nashville, TN"],"affiliations":[{"raw_affiliation_string":"Vanderbilt University,The Electrical Engineering and Computer Science Department,Nashville,TN","institution_ids":["https://openalex.org/I200719446"]},{"raw_affiliation_string":"The Electrical Engineering and Computer Science Department, Vanderbilt University, Nashville, TN","institution_ids":["https://openalex.org/I200719446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5041744190"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":1.8018,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86448848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1444","last_page":"1449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9926999807357788,"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/T11031","display_name":"Game Theory and Applications","score":0.9926999807357788,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9794999957084656,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9484000205993652,"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/controllability","display_name":"Controllability","score":0.8150343298912048},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.5917303562164307},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5719751119613647},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5591842532157898},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5239700675010681},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4770500063896179},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4647129774093628},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4643687605857849},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.440575510263443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43553784489631653},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4208996593952179},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.41891348361968994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3446224331855774},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33318787813186646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2618207335472107},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.15168657898902893},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1487463116645813}],"concepts":[{"id":"https://openalex.org/C48209547","wikidata":"https://www.wikidata.org/wiki/Q1331104","display_name":"Controllability","level":2,"score":0.8150343298912048},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.5917303562164307},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5719751119613647},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5591842532157898},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5239700675010681},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4770500063896179},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4647129774093628},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4643687605857849},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.440575510263443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43553784489631653},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4208996593952179},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.41891348361968994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3446224331855774},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33318787813186646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2618207335472107},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.15168657898902893},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1487463116645813},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc53348.2022.9867655","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc53348.2022.9867655","pdf_url":null,"source":{"id":"https://openalex.org/S4363607732","display_name":"2022 American Control Conference (ACC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 American Control Conference (ACC)","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":22,"referenced_works":["https://openalex.org/W652137832","https://openalex.org/W1669520380","https://openalex.org/W1938602245","https://openalex.org/W1972645710","https://openalex.org/W2011638714","https://openalex.org/W2023351932","https://openalex.org/W2049708951","https://openalex.org/W2078008084","https://openalex.org/W2103151730","https://openalex.org/W2109583010","https://openalex.org/W2111725629","https://openalex.org/W2171863654","https://openalex.org/W2175011670","https://openalex.org/W2763583074","https://openalex.org/W2795526790","https://openalex.org/W2936631157","https://openalex.org/W2963480971","https://openalex.org/W2964299423","https://openalex.org/W3049739658","https://openalex.org/W3126613868","https://openalex.org/W4294690626","https://openalex.org/W6621568289"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2979334915"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,25,30,69,98],"problem":[4,16,28,49,70,101],"of":[5,34,42],"computing":[6],"a":[7,40,46,80,93,103],"minimum":[8,43,81,99],"zero":[9],"forcing":[10],"set":[11],"(ZFS)":[12],"in":[13,50,83,86],"graphs.":[14,38,66,114],"The":[15],"is":[17,21,45],"important":[18],"because":[19],"it":[20],"directly":[22],"related":[23],"to":[24,78],"leader":[26],"selection":[27],"for":[29,64],"strong":[31],"structural":[32],"controllability":[33],"networks":[35],"defined":[36],"over":[37],"Computing":[39],"ZFS":[41,82,100],"size":[44],"well-known":[47],"NP-hard":[48],"general.":[51],"We":[52,67],"show":[53],"that":[54],"previously":[55],"known":[56],"greedy":[57],"heuristic":[58],"could":[59],"give":[60],"arbitrarily":[61],"bad":[62],"solutions":[63],"some":[65],"study":[68],"on":[71,112],"trees":[72],"and":[73],"present":[74,92],"an":[75],"optimal":[76],"algorithm":[77],"compute":[79],"linear":[84],"time":[85],"trees.":[87],"For":[88],"general":[89],"graphs,":[90],"we":[91,107],"game-theoretic":[94],"solution":[95],"by":[96],"formalizing":[97],"as":[102],"potential":[104],"game.":[105],"Finally,":[106],"numerically":[108],"evaluate":[109],"our":[110],"results":[111],"random":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
