{"id":"https://openalex.org/W2140661653","doi":"https://doi.org/10.1142/s1793830912500450","title":"COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS","display_name":"COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS","publication_year":2012,"publication_date":"2012-08-06","ids":{"openalex":"https://openalex.org/W2140661653","doi":"https://doi.org/10.1142/s1793830912500450","mag":"2140661653"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830912500450","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500450","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/A5025849953","display_name":"D. Pradhan","orcid":"https://orcid.org/0000-0003-4100-4414"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"D. PRADHAN","raw_affiliation_strings":["Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012, India","Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, INDIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012, India","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, INDIA","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025849953"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":4.8597,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.95501086,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"04","issue":"03","first_page":"1250045","last_page":"1250045"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9955999851226807,"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.9645000100135803,"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/combinatorics","display_name":"Combinatorics","score":0.8419662714004517},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.8071620464324951},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7990342378616333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7830884456634521},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.600860059261322},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.511919379234314},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4835186004638672},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45566123723983765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38815250992774963},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.24019524455070496},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.07340613007545471}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8419662714004517},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8071620464324951},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7990342378616333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7830884456634521},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.600860059261322},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.511919379234314},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4835186004638672},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45566123723983765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38815250992774963},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.24019524455070496},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.07340613007545471}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830912500450","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500450","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":21,"referenced_works":["https://openalex.org/W1543322965","https://openalex.org/W1555816812","https://openalex.org/W1596396298","https://openalex.org/W1987507610","https://openalex.org/W2006503776","https://openalex.org/W2015837941","https://openalex.org/W2050228489","https://openalex.org/W2057180123","https://openalex.org/W2058160343","https://openalex.org/W2062210818","https://openalex.org/W2062476001","https://openalex.org/W2063906290","https://openalex.org/W2068361557","https://openalex.org/W2078037585","https://openalex.org/W2079887842","https://openalex.org/W2080793356","https://openalex.org/W2083981623","https://openalex.org/W2089465933","https://openalex.org/W2113467420","https://openalex.org/W2398212301","https://openalex.org/W2753313396"],"related_works":["https://openalex.org/W2794522194","https://openalex.org/W2963404550","https://openalex.org/W1123717642","https://openalex.org/W2006955534","https://openalex.org/W2984335350","https://openalex.org/W4312062610","https://openalex.org/W3217516113","https://openalex.org/W4226354266","https://openalex.org/W1555816812","https://openalex.org/W2029336174"],"abstract_inverted_index":{"In":[0,31,69],"this":[1],"paper,":[2],"we":[3],"consider":[4],"minimum":[5,16,22,33,71,148,174,201,224,253],"total":[6,18,24,34,74,149,175,204,226,255],"domination":[7,19,25,35,75,176,205,227,256],"problem":[8,20,26,76,177,206,228,257],"along":[9],"with":[10,142],"two":[11],"of":[12,49,172],"its":[13],"variations":[14],"namely,":[15],"signed":[17,72,202],"and":[21,118,164,245],"minus":[23],"for":[27,64,77,113,132,178,207,229,278],"chordal":[28,135,179,208,230],"bipartite":[29,136,180,209,231],"graphs.":[30],"the":[32,37,70,119,170,173,200,223,252],"problem,":[36],"objective":[38],"is":[39,85,126,218,258],"to":[40,87,187,198,221,259],"find":[41,88,260],"a":[42,50,78,89,133,143,147,195,239,246,261],"smallest":[43,262],"size":[44],"subset":[45,263],"TD":[46,264],"\u2286":[47,266],"V":[48,93,267],"given":[51,134],"graph":[52,79,137,247],"G":[53,60,80,103,108,138,248,274],"=":[54,81,105,122,139,162,166,249],"(V,":[55,82,140,250],"E)":[56,141],"such":[57,100,268],"that":[58,101,131,269],"|TD\u2229N":[59],"(v)|":[61,275],"\u2265":[62,111,243,276],"1":[63,112,244],"every":[65,279],"v":[66,115,280],"\u2208":[67,116,281],"V.":[68,282],"(minus)":[73,203],"E),":[83,251],"it":[84],"required":[86],"function":[90],"f":[91],":":[92],"\u2192":[94],"{-1,":[95],"1}":[96],"({-1,":[97],"0,":[98],"1})":[99],"f(N":[102],"(v))":[104],"\u2211":[106,123],"u\u2208N":[107],"(v)":[109],"f(u)":[110],"each":[114],"V,":[117],"cost":[120],"f(V)":[121],"v\u2208V":[124],"f(v)":[125],"minimized.":[127],"We":[128,192],"first":[129],"show":[130],"weak":[144],"elimination":[145],"ordering,":[146],"dominating":[150],"set":[151],"can":[152],"be":[153],"computed":[154],"in":[155,211,233],"O(n":[156,183,188,212,234],"+":[157,189,213,235],"m)":[158,190,214,236],"time,":[159],"where":[160],"n":[161],"|V|":[163],"m":[165],"|E|.":[167],"This":[168],"improves":[169],"complexity":[171],"graphs":[181,210,232],"from":[182],"2":[184],")":[185],"time":[186],"time.":[191,215,237],"then":[193],"adopt":[194],"unified":[196],"approach":[197],"solve":[199,222],"The":[216],"method":[217],"also":[219],"able":[220],"k-tuple":[225,254],"For":[238],"fixed":[240],"integer":[241],"k":[242,265,271,277],"|TD":[270],"\u2229":[272],"N":[273]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":12}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}