{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:56Z","timestamp":1760245016979},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01305236","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T05:20:39Z","timestamp":1111728039000},"page":"433-447","source":"Crossref","is-referenced-by-count":15,"title":["On the spanning trees of weighted graphs"],"prefix":"10.1007","volume":"12","author":[{"given":"Ernst W.","family":"Mayr","sequence":"first","affiliation":[]},{"given":"C. Greg","family":"Plaxton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds: Systems of distinct representatives and linear algebra,J. of Research and the National Bureau of Standards 71B (1967), 241?245.","journal-title":"J. of Research and the National Bureau of Standards"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman, andR. E. Tarjan: Fibonacci heaps and their uses in improved network optimization algorithms,JACM 34 (1987), 596?615.","journal-title":"JACM"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1145\/322092.322097","volume":"25","author":"D. B. Johnson","year":"1978","unstructured":"D. B. Johnson, andS. D. Kashdan: Lower bounds for selection inX+Y and other multisets,JACM 25 (1978), 556?570.","journal-title":"JACM"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCT.1971.1083291","volume":"18","author":"Y. Kajitani","year":"1971","unstructured":"Y. Kajitani: Graph theoretical properties of the node determinant of an LCR network,IEEE Trans. Circuit Theory CT-18 (1971), 343?350.","journal-title":"IEEE Trans. Circuit Theory CT-"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF02579450","volume":"7","author":"M. Kano","year":"1987","unstructured":"M. Kano: Maximum andkth maximal spanning trees of a weighted graph,Combinatorica 7 (1987), 205?214.","journal-title":"Combinatorica"},{"key":"CR6","first-page":"988","volume":"61A","author":"T. Kawamoto","year":"1978","unstructured":"T. Kawamoto, Y. Kajitani, andS. Shinoda: On the second maximal spanning trees of a weighted graph (in Japanese),Trans. IECE of Japan 61A (1978), 988?995.","journal-title":"Trans. IECE of Japan"},{"key":"CR7","unstructured":"D. E. Knuth:The Art of Computer Programming Vol. I: Fundamental Algorithms, Addison-Wesley, Reading, Mass."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal","year":"1956","unstructured":"J. B. Kruskal: On the shortest spanning subtree of a graph and the traveling salesman problem,Proc. Amer. Math. Soc. 7 (1956), 48?50.","journal-title":"Proc. Amer. Math. Soc."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E. L. Lawler","year":"1972","unstructured":"E. L. Lawler: A procedure for computing theK best solutions to discrete optimization problems and its application to the shortest path problem,Management Sci. 18 (1972), 401?405.","journal-title":"Management Sci."},{"key":"CR10","first-page":"89","volume":"2","author":"Okada","year":"1952","unstructured":"Okada, andOnodera:Bull. Yamagata Univ. 2 (1952), 89?117 (cited in [7]).","journal-title":"Bull. Yamagata Univ."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. C. Prim","year":"1957","unstructured":"R. C. Prim: Shortest connection networks and some generalizationsBell System Technical J. 36 (1957), 1389?1401.","journal-title":"Bell System Technical J."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01305236.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01305236\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01305236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T14:09:01Z","timestamp":1556633341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01305236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01305236"],"URL":"https:\/\/doi.org\/10.1007\/bf01305236","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}