{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T11:45:16Z","timestamp":1780919116704,"version":"3.54.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0012-365x(02)00803-8","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"133-142","source":"Crossref","is-referenced-by-count":70,"title":["Finding a maximum induced matching in weakly chordal graphs"],"prefix":"10.1016","volume":"266","author":[{"given":"Kathie","family":"Cameron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Sritharan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yingwen","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00803-8_BIB1","series-title":"Graph Classes\u2014A Survey","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/S0012-365X(02)00803-8_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","article-title":"Induced matchings","volume":"24","author":"Cameron","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB3","doi-asserted-by":"crossref","unstructured":"K. Cameron, Induced matchings in intersection graphs, Extended abstract, Proceedings of the Sixth International Conference on Graph Theory, Marseille, France, August, 2000; Electron. Notes Discrete Math. 5 (2000), forthcoming.","DOI":"10.1016\/S1571-0653(05)80122-2"},{"key":"10.1016\/S0012-365X(02)00803-8_BIB4","unstructured":"J.-M. Chang, Induced matchings in asteroidal triple-free graphs, Preprint."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB5","first-page":"239","article-title":"Strong matchings on trees","volume":"89","author":"Fricke","year":"1992","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","article-title":"Maximum weight independent sets and cliques in intersection graphs of filaments","volume":"73","author":"Gavril","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB7","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\/S0012-365X(02)00803-8_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","article-title":"New results on induced matchings","volume":"101","author":"Golumbic","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","article-title":"Comparability graphs and intersection graphs","volume":"43","author":"Golumbic","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB10","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(02)00803-8_BIB11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01788689","article-title":"Optimizing weakly triangulated graphs","volume":"5","author":"Hayward","year":"1989","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/S0012-365X(02)00803-8_BIB12","unstructured":"R.B. Hayward, J.P. Spinrad, R. Sritharan, Weakly chordal graph algorithms via handles, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2000, pp. 42\u201349."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(92)90684-8","article-title":"Threshold functions for classes of intersection graphs","volume":"108","author":"Janson","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB14","doi-asserted-by":"crossref","unstructured":"C.W. Ko, F.B. Shepherd, Adding an identity to a totally unimodular matrix, LSE Operations Research Working Paper, LSEOR.94.12, 1994.","DOI":"10.1016\/0167-6377(94)90047-7"},{"key":"10.1016\/S0012-365X(02)00803-8_BIB15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","article-title":"Covering and coloring polygon-circle graphs","volume":"163","author":"Kostochka","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","article-title":"Algorithms for weakly triangulated graphs","volume":"19","author":"Spinrad","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(02)00803-8_BIB17","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","article-title":"NP-completeness of some generalizations of the maximum matching problem","volume":"15","author":"Stockmeyer","year":"1982","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008038?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008038?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T13:12:19Z","timestamp":1584018739000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0012365X02008038"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00803-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}