{"id":"https://openalex.org/W3081529052","doi":"https://doi.org/10.1142/s1793830921500129","title":"Fast and simple algorithms for counting dominating sets in distance-hereditary graphs","display_name":"Fast and simple algorithms for counting dominating sets in distance-hereditary graphs","publication_year":2020,"publication_date":"2020-08-29","ids":{"openalex":"https://openalex.org/W3081529052","doi":"https://doi.org/10.1142/s1793830921500129","mag":"3081529052"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921500129","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500129","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/A5102148083","display_name":"Min-Sheng Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I118292597","display_name":"National Taipei University of Technology","ror":"https://ror.org/00cn92c09","country_code":"TW","type":"education","lineage":["https://openalex.org/I118292597"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Min-Sheng Lin","raw_affiliation_strings":["Department of Electrical Engineering, National Taipei University of Technology, Taipei 10608, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Taipei University of Technology, Taipei 10608, Taiwan","institution_ids":["https://openalex.org/I118292597"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102148083"],"corresponding_institution_ids":["https://openalex.org/I118292597"],"apc_list":null,"apc_paid":null,"fwci":0.1407,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52577107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"02","first_page":"2150012","last_page":"2150012"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9962000250816345,"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.9954000115394592,"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/chordal-graph","display_name":"Chordal graph","score":0.939302921295166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.769608736038208},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7602968215942383},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.7085482478141785},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6490815281867981},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6178189516067505},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6076443195343018},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5134497880935669},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4997408390045166},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.4879564642906189},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.44385582208633423},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.35064980387687683},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27788466215133667},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16927295923233032}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.939302921295166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.769608736038208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7602968215942383},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.7085482478141785},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6490815281867981},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6178189516067505},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6076443195343018},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5134497880935669},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4997408390045166},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.4879564642906189},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.44385582208633423},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.35064980387687683},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27788466215133667},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16927295923233032}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830921500129","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500129","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":[{"id":"https://openalex.org/G4452296050","display_name":null,"funder_award_id":"106-2221-E-027-025","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"}],"funders":[{"id":"https://openalex.org/F4320322795","display_name":"Ministry of Science and Technology, Taiwan","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W123842721","https://openalex.org/W1546500602","https://openalex.org/W1579049696","https://openalex.org/W1975501803","https://openalex.org/W1981303423","https://openalex.org/W1981356557","https://openalex.org/W1989983876","https://openalex.org/W2013491634","https://openalex.org/W2040405987","https://openalex.org/W2041910029","https://openalex.org/W2059518216","https://openalex.org/W2113994674","https://openalex.org/W2115826669","https://openalex.org/W2152792800","https://openalex.org/W2157955289","https://openalex.org/W2169489397","https://openalex.org/W2783719167"],"related_works":["https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W4385327816","https://openalex.org/W1681620790","https://openalex.org/W4298846841","https://openalex.org/W2952658105","https://openalex.org/W2898526288","https://openalex.org/W2607123191","https://openalex.org/W2083238533","https://openalex.org/W2950872944"],"abstract_inverted_index":{"Counting":[0],"dominating":[1],"sets":[2],"(DSs)":[3],"in":[4,61],"a":[5,8],"graph":[6],"is":[7,36],"#P-complete":[9],"problem":[10,31],"even":[11],"for":[12,32,49],"chordal":[13,25,42],"bipartite":[14],"graphs":[15],"and":[16,52,58],"split":[17],"graphs,":[18,34],"which":[19,35],"are":[20],"both":[21],"subclasses":[22],"of":[23,40],"weakly":[24,41],"graphs.":[26,43,63],"This":[27,44],"paper":[28],"investigates":[29],"this":[30],"distance-hereditary":[33,62],"another":[37],"known":[38],"subclass":[39],"work":[45],"develops":[46],"linear-time":[47],"algorithms":[48],"counting":[50],"DSs":[51,57,60],"their":[53],"two":[54],"variants,":[55],"total":[56],"connected":[59]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}