{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:53:05Z","timestamp":1775523185448,"version":"3.50.1"},"reference-count":4,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10267,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let A be a finite set of points in a Euclidean space E<jats:sup>r<\/jats:sup> and M a minimum spanning tree (MST) for A, regarded as a subset of E<jats:sup>r<\/jats:sup>. If A\u2032 \u2282 E<jats:sup>r<\/jats:sup> is a finite subset of M, then M is a spanning tree for A \u222a A\u2032, but in general M will no longer be an MST. However, if A\u2032 is chosen to be the set of all the midpoints of the line segments of M, then M will be an MST for A \u222a A\u2032. Examples are given in which at least |A| \u2010 1 points must be adjoined to avoid destroying the MST.<\/jats:p>","DOI":"10.1002\/net.3230080302","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:50:02Z","timestamp":1178873402000},"page":"187-192","source":"Crossref","is-referenced-by-count":2,"title":["A note on bisecting minimum spanning trees"],"prefix":"10.1002","volume":"8","author":[{"given":"W. M.","family":"Boyce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. R.","family":"Garey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. S.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"e_1_2_1_3_2","unstructured":"Graham R. L. \u201cSome Results on Steiner Minimal Trees \u201d unpublished memorandum Bell Laboratories 1967."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:42:58Z","timestamp":1699778578000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,9]]}},"alternative-id":["10.1002\/net.3230080302"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080302","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,9]]}}}