乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:51:56Z","timestamp":1720335116447},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002923","name":"Consejo Nacional de Investigaciones Cient\u00edficas y T\u00e9cnicas","doi-asserted-by":"publisher","award":["PID-UNR ING 539","277","PID-UNR ING 504","MINCyT-MHEST SLO 14\/09","PICT ANPCyT 2016-0410","2015-2017"],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1016\/j.ipl.2018.06.007","type":"journal-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T02:15:40Z","timestamp":1530152140000},"page":"75-80","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Complexity of k-tuple total and total {k}-dominations for some subclasses of bipartite graphs"],"prefix":"10.1016","volume":"138","author":[{"given":"G.","family":"Argiroffo","sequence":"first","affiliation":[]},{"given":"V.","family":"Leoni","sequence":"additional","affiliation":[]},{"given":"P.","family":"Torres","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/j.ipl.2018.06.007_br0010","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","article-title":"Some APX-completeness results for cubic graphs","volume":"237","author":"Alimonti","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2018.06.007_br0020","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"key":"10.1016\/j.ipl.2018.06.007_br0030","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ipl.2018.06.007_br0040","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","article-title":"Total domination in graphs","volume":"10","author":"Cockayne","year":"1980","journal-title":"Networks"},{"key":"10.1016\/j.ipl.2018.06.007_br0050","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.ipl.2018.06.007_br0060","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-46784-X_14","article-title":"On the clique-width of perfect graph classes","volume":"1665","author":"Golumbic","year":"1999","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/j.ipl.2018.06.007_br0070","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.ipl.2018.06.007_br0080","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-642-21204-8_18","article-title":"Complexity of total {k}-domination and related problems","volume":"6681","author":"He","year":"2011","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/j.ipl.2018.06.007_br0090","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1016\/j.dam.2010.01.009","article-title":"k-tuple total domination in graphs","volume":"158","author":"Henning","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2018.06.007_br0100","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6525-6","article-title":"Total Domination in Graphs","author":"Henning","year":"2013"},{"key":"10.1016\/j.ipl.2018.06.007_br0110","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","article-title":"A simple paradigm for graph recognition: application to cographs and distance hereditary graphs","volume":"263","author":"Damiand","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2018.06.007_br0120","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2018.06.007_br0130","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10878-008-9144-2","article-title":"On the total {k}-domination number of Cartesian products of graphs","volume":"18","author":"Li","year":"2009","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.ipl.2018.06.007_br0140","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","article-title":"Approximating clique-width and branch-width","volume":"96","author":"Oum","year":"2006","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ipl.2018.06.007_br0150","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/j.ipl.2012.07.010","article-title":"Algorithmic aspects of k-tuple total domination in graphs","volume":"112","author":"Pradhan","year":"2012","journal-title":"Inf. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019018301327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019018301327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T19:29:32Z","timestamp":1617478172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019018301327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":15,"alternative-id":["S0020019018301327"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2018.06.007","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2018,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity of k-tuple total and total {k}-dominations for some subclasses of bipartite graphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2018.06.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}