{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:50Z","timestamp":1759063550127},"reference-count":16,"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(98)00006-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"79-91","source":"Crossref","is-referenced-by-count":24,"title":["Matching and multidimensional matching in chordal and strongly chordal graphs"],"prefix":"10.1016","volume":"84","author":[{"given":"Elias","family":"Dahlhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00006-7_BIB1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","article-title":"A polynomial time algorithm for b-matching","volume":"24","author":"Anstee","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00006-7_BIB2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00006-7_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(98)00006-7_BIB4","first-page":"146","article-title":"Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs","volume":"vol. 1178","author":"Chang","year":"1996"},{"key":"10.1016\/S0166-218X(98)00006-7_BIB5","series-title":"Habilitation Thesis","article-title":"Chordale Graphen im besonderen Hinblick auf parallele Algorithmen","author":"Dahlhaus","year":"1991"},{"key":"10.1016\/S0166-218X(98)00006-7_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(98)00006-7_BIB7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0166-218X(98)00006-7_BIB8","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(98)00006-7_BIB9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(98)00006-7_BIB10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of cocomparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canadian J. Math."},{"key":"10.1016\/S0166-218X(98)00006-7_BIB11","series-title":"VLSI Algorithms and Architectures","first-page":"12","article-title":"Two processor scheduling is in NC","volume":"vol. 227","author":"Helmbold","year":"1986"},{"key":"10.1016\/S0166-218X(98)00006-7_BIB12","doi-asserted-by":"crossref","unstructured":"C. Lekkerkerker, J. Boland, Representation of a finite graph by a set of intervals on the real line, Fundam. Math. 51.","DOI":"10.4064\/fm-51-1-45-64"},{"key":"10.1016\/S0166-218X(98)00006-7_BIB13","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(93)90117-R","article-title":"Finding a maximum matching in a circular arc graph","volume":"45","author":"Liang","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00006-7_BIB14","article-title":"Matching theory","volume":"29","author":"Lovasz","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00006-7_BIB15","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(98)00006-7_BIB16","series-title":"3rd IPCO Conf.","first-page":"385","article-title":"A general class of greedily solvable linear programs","author":"Queyranne","year":"1993"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T08:32:07Z","timestamp":1580891527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0166218X98000067"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00006-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}