{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:03:28Z","timestamp":1726517008485},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997,1]]},"DOI":"10.1016\/s0020-0190(96)00193-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"107-111","source":"Crossref","is-referenced-by-count":42,"title":["A linear-time algorithm for the weighted feedback vertex problem on interval graphs"],"prefix":"10.1016","volume":"61","author":[{"family":"Chin Lung Lu","sequence":"first","affiliation":[]},{"family":"Chuan Yi Tang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(96)00193-7_BIB1","series-title":"Proc. 18th Workshop on Graph-Theoretic in Computer Science","first-page":"1","article-title":"On improved time bounds for permutation graph problem","volume":"Vol. 657","author":"Brandst\u00e4dt","year":"1993"},{"key":"10.1016\/S0020-0190(96)00193-7_BIB2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","article-title":"On domination problems for permutation and other graphs","volume":"54","author":"Brandst\u00e4dt","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0020-0190(96)00193-7_BIB3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(95)00048-V","article-title":"Algorithmic aspects of the generalized clique-transversal problem on chordal graphs","volume":"66","author":"Chang","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(96)00193-7_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(86)90156-1","article-title":"Ki-covers I: Complexity and polytopes","volume":"58","author":"Conforti","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(96)00193-7_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","article-title":"The complexity of generalized clique covering","volume":"22","author":"Corneil","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(96)00193-7_BIB6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"year":"1979","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0020-0190(96)00193-7_BIB7"},{"key":"10.1016\/S0020-0190(96)00193-7_BIB8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/net.3230170407","article-title":"Algorithms for maximum k-colorings and k-coverings of transitive graphs","volume":"17","author":"Gavril","year":"1987","journal-title":"Networks"},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/S0020-0190(96)00193-7_BIB9"},{"key":"10.1016\/S0020-0190(96)00193-7_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(92)90216-I","article-title":"An efficient algorithm for finding a maximum weight 2-independent set on interval graphs","volume":"43","author":"Hsiao","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(96)00193-7_BIB11","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(96)00193-7_BIB12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(94)00133-2","article-title":"On the feedback vertex set problem in permutation graphs","volume":"52","author":"Liang","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(96)00193-7_BIB13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(92)90116-R","article-title":"Generalized vertex covering in interval graphs","volume":"39","author":"Marathe","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(96)00193-7_BIB14","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/43.31548","article-title":"A new approach to topological via minimization","volume":"8","author":"Sarrafzadeh","year":"1989","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"10.1016\/S0020-0190(96)00193-7_BIB15","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/BF01185340","article-title":"Maximum k-covering of weighted transitive graphs with applications","volume":"9","author":"Sarrafzadeh","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(96)00193-7_BIB16","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","article-title":"Node-deletion problem on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(96)00193-7_BIB17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colorable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001937?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001937?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:53:49Z","timestamp":1556643229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019096001937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0020019096001937"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(96)00193-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}
