{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:18Z","timestamp":1759638558992},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:p> Counting dominating sets in a graph is a #P-complete problem even in planar graphs. This paper studies this problem for generalized series-parallel graphs, which are a subclass of planar graphs. This work develops some linear-time algorithms for counting dominating sets and their two variants, independent dominating sets and connected dominating sets in generalized series-parallel graphs. <\/jats:p>","DOI":"10.1142\/s1793830919500745","type":"journal-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T07:13:48Z","timestamp":1569568428000},"page":"1950074","source":"Crossref","is-referenced-by-count":1,"title":["Counting dominating sets in generalized series-parallel graphs"],"prefix":"10.1142","volume":"11","author":[{"given":"Min-Sheng","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, National Taipei University of Technology, Taipei 10608, Taiwan"}]}],"member":"219","published-online":{"date-parts":[[2019,12,19]]},"reference":[{"key":"S1793830919500745BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90112-2"},{"key":"S1793830919500745BIB002","first-page":"77","volume-title":"Intelligent Systems and Applications, Proc. International Computer Symposium (ICS)","author":"Chang S. C.","year":"2015"},{"key":"S1793830919500745BIB003","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"S1793830919500745BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-386870-1.50030-7"},{"key":"S1793830919500745BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.044"},{"key":"S1793830919500745BIB006","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793304601"},{"key":"S1793830919500745BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22685-4_2"},{"key":"S1793830919500745BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90003-3"},{"key":"S1793830919500745BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90022-1"},{"key":"S1793830919500745BIB010","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"S1793830919500745BIB011","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150109"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T06:44:07Z","timestamp":1576824247000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":11,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["10.1142\/S1793830919500745"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500745","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}