{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:07:35Z","timestamp":1649120855967},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7321,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0166-218x(93)90225-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"99-108","source":"Crossref","is-referenced-by-count":7,"title":["Efficient sets in graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"P.J.","family":"Bernhard","sequence":"first","affiliation":[]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"D.P.","family":"Jacobs","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90225-D_BIB1","series-title":"Applications of Discrete Mathematics, SIAM","first-page":"189","article-title":"Efficient dominating sets in graphs","author":"Bange","year":"1988"},{"key":"10.1016\/0166-218X(93)90225-D_BIB2","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear-time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90225-D_BIB3","author":"Cockayne","year":"1988","journal-title":"Efficient domination in graphs"},{"key":"10.1016\/0166-218X(93)90225-D_BIB4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","article-title":"Planar 3DM is NP-complete","volume":"7","author":"Dyer","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90225-D_BIB5","first-page":"219","article-title":"Computing the maximum order of an open irredundant set in a tree","volume":"41","author":"Farley","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(93)90225-D_BIB6","first-page":"47","article-title":"Senders in broadcast networks: open irredundancy in graphs","volume":"38","author":"Farley","year":"1983","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(93)90225-D_BIB7","author":"Fellows","year":"1990","journal-title":"The irredundance cube"},{"key":"10.1016\/0166-218X(93)90225-D_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(93)90225-D_BIB9","unstructured":"D.L. Grinstead and P.J. Slater, A recurrence template for several domination related parameters in series-parallel graphs, unpublished manuscript."},{"key":"10.1016\/0166-218X(93)90225-D_BIB10","series-title":"Ph.D. thesis","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390225D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390225D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:32Z","timestamp":1555136732000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390225D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0166218X9390225D"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90225-d","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}