{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:25Z","timestamp":1759335505256},"reference-count":4,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1974,1,1]],"date-time":"1974-01-01T00:00:00Z","timestamp":126230400000},"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":14442,"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":[[1974]]},"DOI":"10.1016\/0012-365x(74)90155-1","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T20:20:14Z","timestamp":1060287614000},"page":"355-361","source":"Crossref","is-referenced-by-count":4,"title":["Complementary bases of a matroid"],"prefix":"10.1016","volume":"8","author":[{"given":"T.L.","family":"Magnanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(74)90155-1_BIB1","doi-asserted-by":"crossref","DOI":"10.21236\/AD0701309","article-title":"On bounds for complementary trees in a graph","author":"Adler","year":"1969"},{"key":"10.1016\/0012-365X(74)90155-1_BIB2","series-title":"Integer and Nonlinear Programming","first-page":"499","article-title":"Complementary spanning trees","author":"Dantzig","year":"1970"},{"issue":"3","key":"10.1016\/0012-365X(74)90155-1_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","article-title":"Transversals and matroid partition","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Natl. Bur. Standards Sect. B"},{"key":"10.1016\/0012-365X(74)90155-1_BIB4","series-title":"Proc. Calgary International Conference","first-page":"233","article-title":"Optimal matroid intersections","author":"Lawler","year":"1970"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X74901551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X74901551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T02:22:59Z","timestamp":1552616579000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X74901551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1974]]}},"alternative-id":["0012365X74901551"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(74)90155-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1974]]}}}