{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:52:16Z","timestamp":1680450736624},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":5556,"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":[[1998,5]]},"DOI":"10.1016\/s0166-218x(97)00136-4","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"71-77","source":"Crossref","is-referenced-by-count":2,"title":["Maximum vertex-weighted matching in strongly chordal graphs"],"prefix":"10.1016","volume":"84","author":[{"given":"Manoel B.","family":"Camp\u00ealo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00136-4_BIB1","series-title":"Technical Report TR-94-043","article-title":"On the computational complexity of matching in chordal and strongly chordal graphs","author":"Dahlhaus","year":"1994"},{"key":"10.1016\/S0166-218X(97)00136-4_BIB2","series-title":"Ph.D. Thesis","article-title":"Applications of linear programming duality to problems involving independence and domination","author":"Farber","year":"1982"},{"key":"10.1016\/S0166-218X(97)00136-4_BIB3","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."},{"key":"10.1016\/S0166-218X(97)00136-4_BIB4","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","article-title":"Doubly lexical orderings of matrices","volume":"16","author":"Lubiw","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00136-4_BIB5","series-title":"Proceedings of the 21th Annual IEEE Symposium on the Foundations of Computer Science","first-page":"17","article-title":"An o(\u221a\u00a6V\u2225E\u00a6) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/S0166-218X(97)00136-4_BIB6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","article-title":"Matching is as easy as matrix inversion","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(97)00136-4_BIB7","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T13:23:47Z","timestamp":1555161827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0166218X97001364"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00136-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}