{"id":"https://openalex.org/W2125524215","doi":"https://doi.org/10.1002/net.3230080302","title":"A note on bisecting minimum spanning trees","display_name":"A note on bisecting minimum spanning trees","publication_year":1978,"publication_date":"1978-09-01","ids":{"openalex":"https://openalex.org/W2125524215","doi":"https://doi.org/10.1002/net.3230080302","mag":"2125524215"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080302","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080302","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020651193","display_name":"William M. Boyce","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"W. M. Boyce","raw_affiliation_strings":["Bell Laboratories Murray Hill, New Jersey","Bell Laboratories, Murray Hill, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, New Jersey","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. R. Garey","raw_affiliation_strings":["Bell Laboratories Murray Hill, New Jersey","Bell Laboratories, Murray Hill, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, New Jersey","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":["Bell Laboratories Murray Hill, New Jersey","Bell Laboratories, Murray Hill, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, New Jersey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020651193"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.2486911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"8","issue":"3","first_page":"187","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8541837930679321},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7974324226379395},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7831411361694336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6766902208328247},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6197428107261658},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.6143074631690979},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5743572115898132},{"id":"https://openalex.org/keywords/midpoint","display_name":"Midpoint","score":0.541718065738678},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5162680149078369},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4728836417198181},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45846331119537354},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.45502951741218567},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.43323901295661926},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.432912141084671},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4311322569847107},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34196075797080994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2073112428188324},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1094214916229248}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8541837930679321},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7974324226379395},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7831411361694336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6766902208328247},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6197428107261658},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.6143074631690979},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5743572115898132},{"id":"https://openalex.org/C34130140","wikidata":"https://www.wikidata.org/wiki/Q1645406","display_name":"Midpoint","level":2,"score":0.541718065738678},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5162680149078369},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4728836417198181},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45846331119537354},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.45502951741218567},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.43323901295661926},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.432912141084671},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4311322569847107},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34196075797080994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2073112428188324},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1094214916229248},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230080302","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080302","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W2017927472","https://openalex.org/W2086709935"],"related_works":["https://openalex.org/W2059360098","https://openalex.org/W2943635264","https://openalex.org/W1561849181","https://openalex.org/W98489388","https://openalex.org/W88291963","https://openalex.org/W2973878682","https://openalex.org/W2014991506","https://openalex.org/W1985149601","https://openalex.org/W3081212354","https://openalex.org/W2048177396"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"A":[2,50,89],"be":[3,60,69,85,104],"a":[4,10,17,26,38,46],"finite":[5,39],"set":[6,71],"of":[7,28,41,72,76,80],"points":[8,102],"in":[9,54,95],"Euclidean":[11],"space":[12],"E":[13,29,35],"r":[14,30,36],"and":[15],"M":[16,44,56,83],"minimum":[18],"spanning":[19,47],"tree":[20,48],"(MST)":[21],"for":[22,49,88],"A,":[23],"regarded":[24],"as":[25],"subset":[27,40],".":[31],"If":[32],"A\u2032":[33,65],"\u2282":[34],"is":[37,45,66],"M,":[42,81],"then":[43,82],"\u222a":[51,90],"A\u2032,":[52],"but":[53],"general":[55],"will":[57,84],"no":[58],"longer":[59],"an":[61,86],"MST.":[62,110],"However,":[63],"if":[64],"chosen":[67],"to":[68,106],"the":[70,74,77,109],"all":[73],"midpoints":[75],"line":[78],"segments":[79],"MST":[87],"A\u2032.":[91],"Examples":[92],"are":[93],"given":[94],"which":[96],"at":[97],"least":[98],"|A|":[99],"\u2010":[100],"1":[101],"must":[103],"adjoined":[105],"avoid":[107],"destroying":[108]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}