{"id":"https://openalex.org/W2975341716","doi":"https://doi.org/10.1142/s1793830919500745","title":"Counting dominating sets in generalized series-parallel graphs","display_name":"Counting dominating sets in generalized series-parallel graphs","publication_year":2019,"publication_date":"2019-09-27","ids":{"openalex":"https://openalex.org/W2975341716","doi":"https://doi.org/10.1142/s1793830919500745","mag":"2975341716"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830919500745","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500745","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.194,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54573793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"06","first_page":"1950074","last_page":"1950074"},"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.9972000122070312,"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.9937999844551086,"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.7173923254013062},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6900240778923035},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.656146764755249},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6483322381973267},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5841915011405945},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5769344568252563},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5456625819206238},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5324676036834717},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.49939441680908203},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.460647851228714},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.43697184324264526},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.433867871761322},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.41287505626678467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32918301224708557},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13347187638282776}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7173923254013062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6900240778923035},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.656146764755249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6483322381973267},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5841915011405945},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5769344568252563},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5456625819206238},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5324676036834717},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.49939441680908203},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.460647851228714},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.43697184324264526},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.433867871761322},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.41287505626678467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32918301224708557},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13347187638282776},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830919500745","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500745","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W123842721","https://openalex.org/W1527401754","https://openalex.org/W1975501803","https://openalex.org/W2006503776","https://openalex.org/W2011039300","https://openalex.org/W2067380255","https://openalex.org/W2078732465","https://openalex.org/W2115826669","https://openalex.org/W2117549465","https://openalex.org/W2153250924"],"related_works":["https://openalex.org/W3101895193","https://openalex.org/W1976784955","https://openalex.org/W1537543462","https://openalex.org/W2898526288","https://openalex.org/W4361825306","https://openalex.org/W2607123191","https://openalex.org/W2749707280","https://openalex.org/W4226049246","https://openalex.org/W2133160845","https://openalex.org/W1979858320"],"abstract_inverted_index":{"Counting":[0],"dominating":[1,38,45,49],"sets":[2,39,46,50],"in":[3,11,51],"a":[4,7,25],"graph":[5],"is":[6],"#P-complete":[8],"problem":[9,18],"even":[10],"planar":[12,28],"graphs.":[13,29,54],"This":[14,30],"paper":[15],"studies":[16],"this":[17],"for":[19,36],"generalized":[20,52],"series-parallel":[21,53],"graphs,":[22],"which":[23],"are":[24],"subclass":[26],"of":[27],"work":[31],"develops":[32],"some":[33],"linear-time":[34],"algorithms":[35],"counting":[37],"and":[40,47],"their":[41],"two":[42],"variants,":[43],"independent":[44],"connected":[48]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}