{"id":"https://openalex.org/W3103195053","doi":"https://doi.org/10.1142/s1793830921500555","title":"On computing secure domination of trees","display_name":"On computing secure domination of trees","publication_year":2020,"publication_date":"2020-11-08","ids":{"openalex":"https://openalex.org/W3103195053","doi":"https://doi.org/10.1142/s1793830921500555","mag":"3103195053"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921500555","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500555","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5085912207","display_name":"Abolfazl Poureidi","orcid":"https://orcid.org/0000-0002-2506-0590"},"institutions":[{"id":"https://openalex.org/I176861719","display_name":"University of Shahrood","ror":"https://ror.org/00yqvtm78","country_code":"IR","type":"education","lineage":["https://openalex.org/I176861719"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Abolfazl Poureidi","raw_affiliation_strings":["Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran"],"raw_orcid":"https://orcid.org/0000-0002-2506-0590","affiliations":[{"raw_affiliation_string":"Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran","institution_ids":["https://openalex.org/I176861719"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085912207"],"corresponding_institution_ids":["https://openalex.org/I176861719"],"apc_list":null,"apc_paid":null,"fwci":0.7226,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77588671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"05","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.9990000128746033,"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.9990000128746033,"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.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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-set","display_name":"Dominating set","score":0.699400782585144},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6614267230033875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6041804552078247},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5603052973747253},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4344950318336487},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4329662322998047},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4208243489265442},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.41663670539855957},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.41529062390327454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39565420150756836},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22436681389808655}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.699400782585144},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6614267230033875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6041804552078247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5603052973747253},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4344950318336487},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4329662322998047},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4208243489265442},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.41663670539855957},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.41529062390327454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39565420150756836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22436681389808655},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830921500555","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500555","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1557513888","https://openalex.org/W2003774469","https://openalex.org/W2026300475","https://openalex.org/W2030324691","https://openalex.org/W2058946695","https://openalex.org/W2202070217","https://openalex.org/W2346913169","https://openalex.org/W2512973258","https://openalex.org/W2732151932","https://openalex.org/W2969941771","https://openalex.org/W4251005761"],"related_works":["https://openalex.org/W2794522194","https://openalex.org/W2963404550","https://openalex.org/W30750922","https://openalex.org/W2033190383","https://openalex.org/W4235356280","https://openalex.org/W4299822763","https://openalex.org/W2339280209","https://openalex.org/W2763279932","https://openalex.org/W3118953946","https://openalex.org/W2612157706"],"abstract_inverted_index":{"Let":[0],"[Formula:":[1,9,17,23,30,35,41,45,54,60,67,72,77,86,98,108,167,171,193,197],"see":[2,10,18,24,31,36,42,46,55,61,68,73,78,87,99,109,168,172,194,198],"text]":[3,11,19,25,32,43,47,56,62,69,74,79,100,169,173,195,199],"be":[4],"a":[5,13,28,49,65,82,93,129,134,140,153,164,180,187],"graph.":[6],"A":[7,38],"subset":[8],"is":[12,27,48,64,80,101,206],"dominating":[14,39,51,83,95,137,190],"set":[15,40,52,84,96,138,191],"of":[16,44,53,85,92,97,107,139,163,192,212],"if":[20,57],"for":[21,58,117,132],"each":[22,59],"there":[26,63],"vertex":[29,66],"adjacent":[33,70],"to":[34,71,157],"text].":[37,88,110],"secure":[50,94,104,118,136,160,189],"such":[75],"that":[76,203],"also":[81],"The":[89],"minimum":[90,135,188],"cardinality":[91],"called":[102],"the":[103,159,210,213],"domination":[105,119,161],"number":[106,162],"Burger":[111,217],"et":[112,218],"al.":[113,219],"[A":[114],"linear":[115,144],"algorithm":[116,131,156,183,214],"in":[120,143,170,196],"trees,":[121],"Discrete":[122],"Appl.":[123],"Math.":[124],"171":[125],"(2014)":[126],"15\u201327]":[127],"proposed":[128,215],"nontrivial":[130],"computing":[133],"given":[141,165],"tree":[142,166],"time":[145,174,200],"and":[146,175,177,201],"space.":[147],"In":[148],"this":[149],"paper,":[150],"we":[151,184],"give":[152],"dynamic":[154],"programming":[155],"compute":[158],"space":[176,202],"then":[178],"using":[179],"backtracking":[181],"search":[182],"can":[185],"find":[186],"its":[204],"implementation":[205,211],"much":[207],"simpler":[208],"than":[209],"by":[216]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}