{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T01:10:33Z","timestamp":1695949833535},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1976,6]]},"DOI":"10.1007\/bf02276756","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T07:46:07Z","timestamp":1134114367000},"page":"115-119","source":"Crossref","is-referenced-by-count":6,"title":["On maximally distant spanning trees of a graph"],"prefix":"10.1007","volume":"17","author":[{"given":"T.","family":"Kameda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02276756_CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. New York: American Elsevier 1973."},{"key":"BF02276756_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/361284.361293","volume":"15","author":"S. M. Chase","year":"1972","unstructured":"Chase, S. M.: An implemented graph algorithm for winning Shannon switching games. Comm. ACM15, 253\u2013256 (1972).","journal-title":"Comm. ACM"},{"key":"BF02276756_CR3","first-page":"67","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Minimum partition of a matroid into independent subsets. J. Res. NBS69B, 67\u201372 (1965).","journal-title":"J. Res. NBS"},{"key":"BF02276756_CR4","series-title":"Seminar Report","volume-title":"An algorithm for finding maximally distant spanning trees","author":"T. Kameda","year":"1974","unstructured":"Kameda, T.: An algorithm for finding maximally distant spanning trees. Seminar Report, I. R. I. A., Roquencourt, France, 1974."},{"key":"BF02276756_CR5","doi-asserted-by":"crossref","unstructured":"Kameda, T., Toida, S.: Efficient algorithms for determining an extremal tree of a graph. Proc. 14th Ann. IEEE Symp. Switch. Automata Theory, 12\u201315 (1973).","DOI":"10.1109\/SWAT.1973.6"},{"key":"BF02276756_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TNS.1969.4325245","volume":"16","author":"G. Kishi","year":"1969","unstructured":"Kishi, G., Kajitani, Y.: On maximally distant trees and principal partition of a linear graph. IEEE Trans. CT-16, 323\u2013330 (1969).","journal-title":"IEEE Trans."},{"key":"BF02276756_CR7","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1137\/0112059","volume":"12","author":"A. Lehman","year":"1964","unstructured":"Lehman, A.: A solution to the Shannon switching game. SIAM J. Appl. Math.12, 684\u2013725 (1964).","journal-title":"SIAM J. Appl. Math."},{"key":"BF02276756_CR8","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C. St. J. A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C. St. J. A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.36, 445\u2013450 (1961).","journal-title":"J. London Math. Soc."},{"key":"BF02276756_CR9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C. St. J. A. Nash-Williams","year":"1964","unstructured":"Nash-Williams, C. St. J. A.: Decomposition of finite graphs into forests. J. London Math. Soc.39, 12 (1964).","journal-title":"J. London Math. Soc."},{"key":"BF02276756_CR10","first-page":"491","volume":"17","author":"T. Ohtsuki","year":"1970","unstructured":"Ohtsuki, T., Ishizaki, Y., Watanabe, H.: Topological degrees of freedom and mixed analysis of electrical networks. IEEE Trans. CT-17, 491\u2013499 (1970).","journal-title":"IEEE Trans."},{"key":"BF02276756_CR11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"Tarjan, R. E.: Depth-first search and linear graph algorithms. SIAM J. Computing1, 146\u2013159 (1972).","journal-title":"SIAM J. Computing"},{"key":"BF02276756_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"3","author":"W. T. Tutte","year":"1961","unstructured":"Tutte, W. T.: On the problem of decomposing a graph inton connected factors. J. London Math. Soc.3, 221\u2013230 (1961).","journal-title":"J. London Math. Soc."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276756.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02276756\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:28:33Z","timestamp":1557944913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02276756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["BF02276756"],"URL":"https:\/\/doi.org\/10.1007\/bf02276756","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}