{"id":"https://openalex.org/W7225138799","doi":"https://doi.org/10.21203/rs.3.rs-11284976/v1","title":"Total Positive Influence Domination in Graphs: Bounds, Exact Optimization, and Heuristics","display_name":"Total Positive Influence Domination in Graphs: Bounds, Exact Optimization, and Heuristics","publication_year":2026,"publication_date":"2026-11-03","ids":{"openalex":"https://openalex.org/W7225138799","doi":"https://doi.org/10.21203/rs.3.rs-11284976/v1"},"language":"en","primary_location":{"id":"doi:10.21203/rs.3.rs-11284976/v1","doi":"https://doi.org/10.21203/rs.3.rs-11284976/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11284976/v1","pdf_url":"https://www.researchsquare.com/article/rs-11284976/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.researchsquare.com/article/rs-11284976/latest.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015836689","display_name":"Ernesto Parra Inza","orcid":"https://orcid.org/0000-0002-7901-4936","observed_orcids":["https://orcid.org/0000-0002-7901-4936"]},"institutions":[{"id":"https://openalex.org/I3130105584","display_name":"Universidad Aut\u00f3noma de Guerrero","ror":"https://ror.org/054tbkd46","country_code":"MX","type":"education","lineage":["https://openalex.org/I3130105584"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Ernesto Parra Inza","raw_affiliation_strings":["Universidad Aut\u00f3noma de Guerrero"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Aut\u00f3noma de Guerrero","institution_ids":["https://openalex.org/I3130105584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5160272100","display_name":"Ismael Rios Villamar","orcid":"https://orcid.org/0009-0007-5190-7058","observed_orcids":["https://orcid.org/0009-0007-5190-7058"]},"institutions":[{"id":"https://openalex.org/I3130105584","display_name":"Universidad Aut\u00f3noma de Guerrero","ror":"https://ror.org/054tbkd46","country_code":"MX","type":"education","lineage":["https://openalex.org/I3130105584"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Ismael Rios Villamar","raw_affiliation_strings":["Universidad Aut\u00f3noma de Guerrero"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Aut\u00f3noma de Guerrero","institution_ids":["https://openalex.org/I3130105584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5160492146","display_name":"Juan Carlos Hern\u00e1ndez G\u00f3mez","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3130105584","display_name":"Universidad Aut\u00f3noma de Guerrero","ror":"https://ror.org/054tbkd46","country_code":"MX","type":"education","lineage":["https://openalex.org/I3130105584"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Juan Carlos Hern\u00e1ndez G\u00f3mez","raw_affiliation_strings":["Universidad Aut\u00f3noma de Guerrero"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Aut\u00f3noma de Guerrero","institution_ids":["https://openalex.org/I3130105584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112691052","display_name":"Jos\u00e9 Mar\u00eda Sigarreta Almira","orcid":"https://orcid.org/0000-0002-0863-4695","observed_orcids":["https://orcid.org/0000-0002-0863-4695","https://orcid.org/0000-0003-4352-5109"]},"institutions":[{"id":"https://openalex.org/I3130105584","display_name":"Universidad Aut\u00f3noma de Guerrero","ror":"https://ror.org/054tbkd46","country_code":"MX","type":"education","lineage":["https://openalex.org/I3130105584"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Mar\u00eda Sigarreta Almira","raw_affiliation_strings":["Universidad Aut\u00f3noma de Guerrero"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Aut\u00f3noma de Guerrero","institution_ids":["https://openalex.org/I3130105584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I3130105584"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7407000064849854,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7407000064849854,"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.2533999979496002,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.0024999999441206455,"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/dominating-sets","display_name":"dominating sets","score":0.6869999766349792},{"id":"https://openalex.org/keywords/minimal-dominating-sets","display_name":"minimal dominating sets","score":0.8619999885559082},{"id":"https://openalex.org/keywords/purification-procedure","display_name":"purification procedure","score":0.9259999990463257},{"id":"https://openalex.org/keywords/binary-integer-linear-programming","display_name":"binary integer linear programming","score":0.8069999814033508},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.9779999852180481},{"id":"https://openalex.org/keywords/approximation-guarantees","display_name":"approximation guarantees","score":0.8370000123977661},{"id":"https://openalex.org/keywords/harmonic-approximation","display_name":"harmonic approximation","score":0.7009999752044678},{"id":"https://openalex.org/keywords/support-vertices","display_name":"support vertices","score":0.6029999852180481},{"id":"https://openalex.org/keywords/domination-in-graphs","display_name":"graph domination","score":0.37299999594688416}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7350999712944031},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5371000170707703},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5142999887466431},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5128999948501587},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5120000243186951},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48820000886917114},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47929999232292175},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.41440001130104065},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4041000008583069},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.39719998836517334},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3882000148296356},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3865000009536743},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37610000371932983},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3508000075817108},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.335099995136261},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32710000872612},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2678000032901764},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.26249998807907104}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21203/rs.3.rs-11284976/v1","doi":"https://doi.org/10.21203/rs.3.rs-11284976/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11284976/v1","pdf_url":"https://www.researchsquare.com/article/rs-11284976/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.21203/rs.3.rs-11284976/v1","doi":"https://doi.org/10.21203/rs.3.rs-11284976/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11284976/v1","pdf_url":"https://www.researchsquare.com/article/rs-11284976/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225138799.pdf","grobid_xml":"https://content.openalex.org/works/W7225138799.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1978520840","https://openalex.org/W1984588599","https://openalex.org/W2069808479","https://openalex.org/W2086536366","https://openalex.org/W2200028304","https://openalex.org/W2865235865","https://openalex.org/W2979328120","https://openalex.org/W2998576649","https://openalex.org/W3043117495","https://openalex.org/W3134096386","https://openalex.org/W3204841430","https://openalex.org/W4233413206","https://openalex.org/W4300856883","https://openalex.org/W4321189517","https://openalex.org/W4386258483","https://openalex.org/W4403666794","https://openalex.org/W6887886317","https://openalex.org/W6962720293","https://openalex.org/W7138936515"],"related_works":["https://openalex.org/W7225057421","https://openalex.org/W1848295871","https://openalex.org/W4210930195","https://openalex.org/W7160089275","https://openalex.org/W2069808479","https://openalex.org/W4286717547","https://openalex.org/W7083166013","https://openalex.org/W1984588599","https://openalex.org/W7204140899","https://openalex.org/W2726616498"],"abstract_inverted_index":{"Abstract":[0],"We":[1,25,61,88,129],"study":[2],"the":[3,22,45,56,91,116,119,138,154,165,175,185,192,198,201,209,219],"total":[4,64],"positive":[5,65],"influence":[6,66,71],"domination":[7],"problem":[8,93],"(TPIDS),":[9],"in":[10,21,31,52,126,153,195],"which":[11,48],"every":[12],"vertex":[13],"must":[14],"have":[15],"at":[16,150],"least":[17],"$\\lceil":[18],"d(v)/2\\rceil$":[19],"neighbors":[20],"selected":[23],"set.":[24],"establish":[26],"lower":[27,41],"and":[28,37,73,100,110,118,173,218],"upper":[29],"bounds":[30],"terms":[32],"of":[33,149,197],"classical":[34],"graph":[35],"parameters":[36],"introduce":[38],"a":[39,75,95,102,111,146],"new":[40],"bound":[42],"based":[43,106],"on":[44,107,159],"degree":[46,57],"sequence,":[47],"can":[49],"be":[50],"computed":[51],"linear":[53,98],"time":[54],"once":[55],"sequence":[58],"is":[59],"available.":[60],"characterize":[62],"minimal":[63,83,181],"dominating":[67],"sets":[68],"through":[69],"private":[70],"vertices":[72,217],"develop":[74],"purification":[76,120,177,207],"procedure":[77,121],"that":[78,164,174],"transforms":[79],"feasible":[80,168,180],"solutions":[81,169],"into":[82],"ones":[84],"while":[85],"preserving":[86],"feasibility.":[87],"also":[89],"formulate":[90],"optimization":[92],"as":[94],"binary":[96],"integer":[97],"program":[99],"propose":[101],"constructive":[103],"greedy":[104],"heuristic":[105,117,166],"support-vertex":[108],"initialization":[109],"maximum-total-active-degree":[112],"selection":[113],"rule.":[114],"Both":[115],"admit":[122],"adjacency-list":[123],"implementations":[124],"running":[125],"$O(n+m)$":[127],"time.":[128],"prove":[130],"an":[131],"instance-dependent":[132],"harmonic":[133],"approximation":[134,155],"guarantee":[135],"$H(\\kappa(G))$":[136],"for":[137,170],"heuristic,":[139],"where":[140],"$\\kappa(G)\\leq\\Delta(G)$;":[141],"thus,":[142],"$H(\\kappa(G))\\leq":[143],"H(\\Delta(G))$,":[144],"with":[145,184,204],"possible":[147],"improvement":[148],"most":[151],"$\\ln(\\Delta(G)/\\kappa(G))$":[152],"factor.":[156],"Computational":[157],"experiments":[158],"1196":[160],"benchmark":[161],"instances":[162,172,203],"show":[163],"produces":[167],"all":[171],"three":[176],"strategies":[178],"produce":[179],"TPIDS,":[182],"consistently":[183],"corresponding":[186],"theoretical":[187],"guarantees.":[188],"Purification":[189],"strictly":[190],"reduces":[191,208],"solution":[193],"cardinality":[194],"89.38%":[196],"instances.":[199],"On":[200],"76":[202],"certified":[205],"optimality,":[206],"average":[210,220],"absolute":[211],"error":[212,222],"from":[213,223],"3.20":[214],"to":[215,225],"2.37":[216],"relative":[221],"4.80%":[224],"3.55%.":[226]},"counts_by_year":[],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2026-11-04T00:00:00"}