{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:36:29Z","timestamp":1758702989727},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,2,1]],"date-time":"1981-02-01T00:00:00Z","timestamp":349833600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1981,2]]},"DOI":"10.1007\/bf00978378","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T09:33:32Z","timestamp":1105263212000},"page":"55-61","source":"Crossref","is-referenced-by-count":23,"title":["Partitioning trees: Matching, domination, and maximum diameter"],"prefix":"10.1007","volume":"10","author":[{"given":"Arthur","family":"Parley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"E. J. Cockayne","year":"1975","unstructured":"E. J. Cockayne, S. E. Goodman, and S. T. Hedetniemi, ?A linear algorithm for the domination number of a tree,?Inform. Process. Lett. 4:41?44 (1975).","journal-title":"Inform. Process. Lett."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"S. Even and O. Kariv, ?An O(n2.5) algorithm for maximum matching in graphs,? Proceedings, 16th Symposium on Foundation of Computing (1975), pp. 382?399.","DOI":"10.1109\/SFCS.1975.5"},{"key":"CR3","volume-title":"Computers and Interactibility: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Interactibility: A Guide to the Theory of NP-completeness (W. H. Freeman, San Francisco, 1979)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0205009","volume":"5","author":"S. E. Goodman","year":"1976","unstructured":"S. E. Goodman, S. T. Hedetniemi, and R. E. Tarjan, ?B-matchings in trees,?SIAM J. Comput. 5:104?107 (1976).","journal-title":"SIAM J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/trsc.8.1.75","volume":"8","author":"S. Halfin","year":"1974","unstructured":"S. Halfin, ?On finding the absolute and vertex centers of a tree with distances,?Transport. Sci. 8:75?77 (1974).","journal-title":"Transport. Sci."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/322092.322100","volume":"25","author":"A. Itai","year":"1978","unstructured":"A. Itai, M. Rodeh, and S. Tanimoto, ?Some matching problems for bipartite graphs,?J. Assoc. Comput. Mach. 25:517?525 (1978).","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"O. Kariv and S. L. Hakimi, ?An algorithmic approach to network location problems. I. The p-centers,?SIAM J. Ap. Math. 37:513?538 (1979).","journal-title":"SIAM J. Ap. Math."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0206012","volume":"6","author":"S. Kundru","year":"1977","unstructured":"S. Kundru and J. Misra, ?A linear tree partitioning algorithm,?SIAM J. Comput. 6:151?154 (1977).","journal-title":"SIAM J. Comput."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00978378.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00978378\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00978378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:38:37Z","timestamp":1556563117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00978378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,2]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,2]]}},"alternative-id":["BF00978378"],"URL":"https:\/\/doi.org\/10.1007\/bf00978378","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,2]]}}}