{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:15Z","timestamp":1725663375812},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_58","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:32:41Z","timestamp":1330201961000},"page":"394-405","source":"Crossref","is-referenced-by-count":3,"title":["On the spanning trees of weighted graphs"],"prefix":"10.1007","author":[{"given":"Ernst W.","family":"Mayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Greg","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"27_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\u2013245.","journal-title":"J. of Research and the National Bureau of Standards"},{"key":"27_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 and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. JACM, 34 (1987), 596\u2013615.","journal-title":"JACM"},{"key":"27_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 and S. D. Kashdan. Lower bounds for selection in X+Y and other multisets. JACM, 25 (1978), 556\u2013570.","journal-title":"JACM"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCT.1971.1083291","volume":"CT-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\u2013350.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF02579450","volume":"7","author":"M. Kano","year":"1987","unstructured":"M. Kano. Maximum and kth maximal spanning trees of a weighted graph. Combinatorica, 7 (1987), 205\u2013214.","journal-title":"Combinatorica"},{"key":"27_CR6","first-page":"988","volume":"61-A","author":"T. Kawamoto","year":"1978","unstructured":"T. Kawamoto, Y. Kajitani and S. Shinoda. On the second maximal spanning trees of a weighted graph (in Japanese). Trans. IECE of Japan, 61-A (1978), 988\u2013995.","journal-title":"Trans. IECE of Japan"},{"key":"27_CR7","unstructured":"D. E. Knuth. The Art of Computer Programming Vol. I: Fundamental Algorithms, Addison-Wesley, Reading, Mass."},{"key":"27_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\u201350.","journal-title":"Proc. Amer. Math. Soc."},{"key":"27_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 the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Sci., 18 (1972), 401\u2013405.","journal-title":"Management Sci."},{"key":"27_CR10","first-page":"89","volume":"2","author":"Okada","year":"1952","unstructured":"Okada and Onodera. Bull. Yamagata Univ., 2 (1952), 89\u2013117 (cited in [Kn]).","journal-title":"Bull. Yamagata Univ."},{"key":"27_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 generalizations. Bell System Technical J., 36 (1957), 1389\u20131401.","journal-title":"Bell System Technical J."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:12Z","timestamp":1619571432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}