{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T08:20:44Z","timestamp":1711009244522},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90011-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:31:50Z","timestamp":1027639910000},"page":"113-116","source":"Crossref","is-referenced-by-count":11,"title":["Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications"],"prefix":"10.1016","volume":"44","author":[{"given":"A.K.","family":"Kelmans","sequence":"first","affiliation":[]},{"given":"B.N.","family":"Kimelfeld","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90011-0_BIB1","series-title":"Inequalities","author":"Beckenbach","year":"1961"},{"key":"10.1016\/0012-365X(83)90011-0_BIB2","series-title":"Th\u00e9orie des Graphes et ses Applications","author":"Berge","year":"1958"},{"key":"10.1016\/0012-365X(83)90011-0_BIB3_1","first-page":"2134","article-title":"The number of trees in a graph, I, II","volume":"26","author":"Kelmans","year":"1965","journal-title":"Avtomat. i Telemeh."},{"key":"10.1016\/0012-365X(83)90011-0_BIB3_2","first-page":"56","article-title":"The number of trees in a graph, I, II","volume":"27","author":"Kelmans","year":"1966","journal-title":"Avtomat. i Telemeh."},{"key":"10.1016\/0012-365X(83)90011-0_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(76)90102-3","article-title":"Comparison of graphs by their number of spanning trees","volume":"16","author":"Kelmans","year":"1976","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83900110?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83900110?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:26:35Z","timestamp":1555140395000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83900110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83900110"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90011-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}