{"id":"https://openalex.org/W4206158811","doi":"https://doi.org/10.1142/s1793830922500513","title":"k-Efficient domination: Algorithmic perspective","display_name":"k-Efficient domination: Algorithmic perspective","publication_year":2022,"publication_date":"2022-01-12","ids":{"openalex":"https://openalex.org/W4206158811","doi":"https://doi.org/10.1142/s1793830922500513"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922500513","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500513","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/A5091305658","display_name":"Mohsen Alambardar Meybodi","orcid":"https://orcid.org/0000-0003-2089-0250"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mohsen Alambardar Meybodi","raw_affiliation_strings":["Faculty of Mathematics and Statistics, Department of Applied Mathematics and Computer Science, University of Isfahan, Isfahan 81746-73441, Iran"],"raw_orcid":"https://orcid.org/0000-0003-2089-0250","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Statistics, Department of Applied Mathematics and Computer Science, University of Isfahan, Isfahan 81746-73441, Iran","institution_ids":["https://openalex.org/I39268498"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091305658"],"corresponding_institution_ids":["https://openalex.org/I39268498"],"apc_list":null,"apc_paid":null,"fwci":0.3017,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56208414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"14","issue":"08","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.9998999834060669,"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.9998999834060669,"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.9970999956130981,"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.984499990940094,"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/combinatorics","display_name":"Combinatorics","score":0.7430197596549988},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5891338586807251},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5811405777931213},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.550517201423645},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.45794764161109924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40259623527526855},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37348031997680664}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7430197596549988},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5891338586807251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5811405777931213},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.550517201423645},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.45794764161109924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40259623527526855},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37348031997680664}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830922500513","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500513","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":[{"display_name":"Peace, Justice and strong institutions","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W560340026","https://openalex.org/W1493071618","https://openalex.org/W1726112952","https://openalex.org/W2010608390","https://openalex.org/W2022841964","https://openalex.org/W2051627428","https://openalex.org/W2140661653","https://openalex.org/W2165864598","https://openalex.org/W2277497915","https://openalex.org/W2512973258","https://openalex.org/W2904438600","https://openalex.org/W3025752602","https://openalex.org/W3041086172"],"related_works":["https://openalex.org/W2794522194","https://openalex.org/W4283726592","https://openalex.org/W1885115167","https://openalex.org/W2963404550","https://openalex.org/W30750922","https://openalex.org/W3118953946","https://openalex.org/W2994748110","https://openalex.org/W2424154501","https://openalex.org/W3171126253","https://openalex.org/W2339280209"],"abstract_inverted_index":{"A":[0,65,279],"set":[1,16,40,91,107,153,199,250,272,318],"[Formula:":[2,8,18,24,32,41,57,87,108,114,121,130,134,154,161,170,176,180,190,195,204,208,246,267,283,289,308,328],"see":[3,9,19,25,33,42,58,88,109,115,122,131,135,155,162,171,177,181,191,196,205,209,247,268,284,290,309,329],"text]":[4,10,20,26,43,59,110,116,123,156,172,192],"of":[5,17,63,67,77,97,150,200,233],"a":[6,105,118,167,174,194,245],"graph":[7,98,175,243],"is":[11,44,85,157,186,214,253,273,307,335],"called":[12,86,158],"an":[13],"efficient":[14,257],"dominating":[15,90,146,198,249,258,317],"if":[21],"every":[22,242],"vertex":[23,39,120],"has":[27,193,244,319],"exactly":[28],"one":[29,51],"neighbor":[30],"in":[31,35,56,128,276,287],"text],":[34,132,178],"other":[36,138],"words,":[37,139],"the":[38,54,61,95,126,142,159,179,265,297,315],"partitioned":[45],"to":[46,104,187,216],"some":[47],"circles":[48],"with":[49,99,144],"radius":[50],"such":[52,111],"that":[53,92,112,305],"vertices":[55,96,127],"are":[60],"centers":[62],"partitions.":[64],"generalization":[66],"this":[68,261],"concept,":[69],"introduced":[70],"by":[71],"Chellali":[72],"et":[73],"al.":[74],"[k-Efficient":[75],"partitions":[76,94,232],"graphs,":[78,234],"Commun.":[79,235],"Comb.":[80,236],"Optim.":[81,237],"4":[82,238],"(2019)":[83,239],"109\u2013122],":[84],"text]-efficient":[89,163,182,197,210,248,269,285,291,330],"briefly":[93],"different":[100],"radiuses.":[101],"It":[102],"leads":[103],"partition":[106],"each":[113],"consists":[117],"center":[119],"and":[124,173,228],"all":[125],"distance":[129],"where":[133],"text].":[136,206],"In":[137,260,301],"there":[140],"exist":[141],"dominators":[143],"various":[145],"powers.":[147],"The":[148,207],"problem":[149,185,213,271],"finding":[151],"minimum":[152,160],"domination":[164,270,286,292,331],"problem.":[165],"Given":[166],"positive":[168],"integer":[169],"Domination":[183,211],"Decision":[184,212],"decide":[188],"whether":[189],"cardinality":[201],"at":[202],"most":[203],"known":[215],"be":[217],"NP-complete":[218,274],"even":[219,275],"for":[220,256,282],"bipartite":[221],"graphs":[222,295,313,334],"[M.":[223],"Chellali,":[224],"T.":[225],"W.":[226],"Haynes":[227],"S.":[229],"Hedetniemi,":[230],"k-Efficient":[231],"109\u2013122].":[240],"Clearly,":[241],"but":[251],"it":[252,306],"not":[254],"correct":[255],"set.":[259],"paper,":[262],"we":[263,303],"study":[264],"following:":[266],"chordal":[277],"graphs.":[278,327],"polynomial-time":[280],"algorithm":[281,324],"trees.":[288],"on":[293,311,325,332],"sparse":[294],"from":[296],"parametrized":[298],"complexity":[299],"perspective.":[300],"particular,":[302],"show":[304],"text]-hard":[310],"d-degenerate":[312,326],"while":[314],"original":[316],"Fixed":[320],"Parameter":[321],"Tractable":[322],"(FPT)":[323],"nowhere-dense":[333],"FPT.":[336]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}