{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:07:35Z","timestamp":1660331255573},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0020-0190(98)00040-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"65-70","source":"Crossref","is-referenced-by-count":3,"title":["Weighted irredundance of interval graphs"],"prefix":"10.1016","volume":"66","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Nagavamsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00040-4_BIB1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0401032","article-title":"Total domination and irredundance in weighted interval graphs","volume":"1","author":"Bertossi","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB3","series-title":"Proc. National Computer Symposium","first-page":"128","article-title":"Irredundance of weighted interval graphs","author":"Chang","year":"1993"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","article-title":"Contributions to the theory of domination, independence and irredundance in graphs","volume":"33","author":"Cockayne","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB5","first-page":"97","article-title":"The probability of an interval graphs, and why it matters","volume":"34","author":"Cohen","year":"1979"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB6","first-page":"219","article-title":"Computing the maximum order of an open irredundant set in a tree","volume":"41","author":"Farley","year":"1984"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB7","first-page":"47","article-title":"Senders in broadcast networks: Open irredundancy in graphs","volume":"38","author":"Farley","year":"1983"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895480191199026","article-title":"The private neighbor cube","volume":"7","author":"Fellows","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(93)90223-B","article-title":"Irredundancy in circular-arc graphs","volume":"44","author":"Golumbic","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB10","first-page":"183","article-title":"Irredundancy in graphs: A survey","volume":"48","author":"Hedetniemi","year":"1985"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB11","series-title":"Third International Symposium, ISAAC-92","first-page":"459","article-title":"A simple test for the consecutive ones property","volume":"Vol. 650","author":"Hsu","year":"1992"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90349-M","article-title":"Chordal graphs and upper irredundance, upper domination and independence","volume":"86","author":"Jacobson","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(93)90224-C","article-title":"A note on graphs which have upper irredundance equal to independence","volume":"44","author":"Jacobson","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","article-title":"An incremental linear-time algorithm for recognizing interval graphs","volume":"18","author":"Korte","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00040-4_BIB15","series-title":"Domination and irredundance in split graphs, Manuscript","author":"Lasker","year":"1983"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB16","article-title":"Irredundance on interval graphs and other classes of graphs","author":"Raman","year":"1992"},{"key":"10.1016\/S0020-0190(98)00040-4_BIB17","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000404?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000404?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:41Z","timestamp":1556058461000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0020019098000404"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00040-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}