{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T07:07:52Z","timestamp":1769238472749,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,13]],"date-time":"2007-10-13T00:00:00Z","timestamp":1192233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00453-007-9045-2","type":"journal-article","created":{"date-parts":[[2007,10,12]],"date-time":"2007-10-12T15:41:27Z","timestamp":1192203687000},"page":"440-447","source":"Crossref","is-referenced-by-count":23,"title":["Maximum Induced Matchings for Chordal Graphs in Linear Time"],"prefix":"10.1007","volume":"52","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,13]]},"reference":[{"key":"9045_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(96)00070-2","volume":"171","author":"A. Brandst\u00e4dt","year":"1997","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Nicolai, F.: LexBFS-orderings and powers of chordal graphs. Discrete Math. 171, 27\u201342 (1997)","journal-title":"Discrete Math."},{"key":"9045_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K. Cameron","year":"1989","unstructured":"Cameron, K.: Induced matchings. Discrete Appl. Math. 24, 97\u2013102 (1989)","journal-title":"Discrete Appl. Math."},{"key":"9045_CR3","doi-asserted-by":"crossref","unstructured":"Cameron, K.: Induced matchings in intersection graphs (extended abstract). Electron. Notes Discrete Math. 5 (2000)","DOI":"10.1016\/S1571-0653(05)80122-2"},{"key":"9045_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","volume":"266","author":"K. Cameron","year":"2003","unstructured":"Cameron, K., Sritharan, R., Tang, Y.: Finding a maximum induced matching in weakly chordal graphs. Discrete Math. 266, 133\u2013142 (2003)","journal-title":"Discrete Math."},{"key":"9045_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0166-218X(03)00390-1","volume":"132","author":"J.-M. Chang","year":"2004","unstructured":"Chang, J.-M.: Induced matchings in asteroidal-triple-free graphs. Discrete Appl. Math. 132, 67\u201378 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9045_CR6","first-page":"239","volume":"89","author":"G. Fricke","year":"1992","unstructured":"Fricke, G., Laskar, R.: Strong matchings on trees. Congr. Numer. 89, 239\u2013243 (1992)","journal-title":"Congr. Numer."},{"key":"9045_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, San Diego (1980)"},{"key":"9045_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(93)90223-B","volume":"44","author":"M.C. Golumbic","year":"1993","unstructured":"Golumbic, M.C., Laskar, R.C.: Irredundancy in circular-arc graphs. Discrete Appl. Math. 44, 79\u201389 (1993)","journal-title":"Discrete Appl. Math."},{"key":"9045_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Lewenstein, M.: New results on induced matchings. Discrete Appl. Math. 101, 157\u2013165 (2000)","journal-title":"Discrete Appl. Math."},{"key":"9045_CR10","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/S089548019828371X","volume":"16","author":"C.W. Ko","year":"2003","unstructured":"Ko, C.W., Shepherd, F.B.: Bipartite domination and simultaneous matroid covers. SIAM J. Discrete Math. 16, 517\u2013523 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"9045_CR11","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00453-003-1035-4","volume":"37","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Finding maximum induced matchings in subclasses of claw-free and P 5-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica 37, 327\u2013346 (2003)","journal-title":"Algorithmica"},{"key":"9045_CR12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"9045_CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"L.J. Stockmeyer","year":"1982","unstructured":"Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inform. Process. Lett. 15, 14\u201319 (1982)","journal-title":"Inform. Process. Lett."},{"key":"9045_CR14","first-page":"58","volume":"7","author":"M. Zito","year":"2000","unstructured":"Zito, M.: Linear time maximum induced matching algorithm for trees. Nord. J. Comput. 7, 58\u201363 (2000)","journal-title":"Nord. J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9045-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9045-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9045-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:59Z","timestamp":1559137499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9045-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,13]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9045"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9045-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,13]]}}}