{"id":"https://openalex.org/W2081205286","doi":"https://doi.org/10.1007/bf01954898","title":"On a proposed divide-and-conquer minimal spanning tree algorithm","display_name":"On a proposed divide-and-conquer minimal spanning tree algorithm","publication_year":1988,"publication_date":"1988-12-01","ids":{"openalex":"https://openalex.org/W2081205286","doi":"https://doi.org/10.1007/bf01954898","mag":"2081205286"},"language":"en","primary_location":{"id":"doi:10.1007/bf01954898","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01954898","pdf_url":null,"source":{"id":"https://openalex.org/S125499977","display_name":"BIT Numerical Mathematics","issn_l":"0006-3835","issn":["0006-3835","1572-9125"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BIT","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/A5113663657","display_name":"Ivan Stojmenovi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I145608581","display_name":"University of Miami","ror":"https://ror.org/02dgjyy92","country_code":"US","type":"education","lineage":["https://openalex.org/I145608581"]},{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]},{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["CZ","RS","US"],"is_corresponding":false,"raw_author_name":"Ivan Stojmenovi\u0107","raw_affiliation_strings":["Department of Computer Science, Washington State University, 99164-1210, Pullman, WA, USA","Department of Mathematics and Computer Science, University of Miami, 33124, Coral Gables, FL, USA","Institute of Mathematics, University of Novi Sad, Yugoslavia","Department of Computer Science, Washington State University, Pullman, USA","Department of Mathematics and Computer Science, University of Miami, Coral Gables, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Washington State University, 99164-1210, Pullman, WA, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Miami, 33124, Coral Gables, FL, USA","institution_ids":["https://openalex.org/I145608581"]},{"raw_affiliation_string":"Institute of Mathematics, University of Novi Sad, Yugoslavia","institution_ids":["https://openalex.org/I170726198","https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Department of Computer Science, Washington State University, Pullman, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Miami, Coral Gables, USA","institution_ids":["https://openalex.org/I145608581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011863644","display_name":"Michael A. Langston","orcid":"https://orcid.org/0000-0001-5945-5796"},"institutions":[{"id":"https://openalex.org/I145608581","display_name":"University of Miami","ror":"https://ror.org/02dgjyy92","country_code":"US","type":"education","lineage":["https://openalex.org/I145608581"]},{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]},{"id":"https://openalex.org/I72951846","display_name":"Washington State University","ror":"https://ror.org/05dk0ce17","country_code":"US","type":"education","lineage":["https://openalex.org/I72951846"]}],"countries":["CZ","RS","US"],"is_corresponding":false,"raw_author_name":"Michael A. Langston","raw_affiliation_strings":["Department of Computer Science, Washington State University, 99164-1210, Pullman, WA, USA","Department of Mathematics and Computer Science, University of Miami, 33124, Coral Gables, FL, USA","Institute of Mathematics, University of Novi Sad, Yugoslavia","Department of Computer Science, Washington State University, Pullman, USA","Department of Mathematics and Computer Science, University of Miami, Coral Gables, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Washington State University, 99164-1210, Pullman, WA, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Miami, 33124, Coral Gables, FL, USA","institution_ids":["https://openalex.org/I145608581"]},{"raw_affiliation_string":"Institute of Mathematics, University of Novi Sad, Yugoslavia","institution_ids":["https://openalex.org/I170726198","https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Department of Computer Science, Washington State University, Pullman, USA","institution_ids":["https://openalex.org/I72951846"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Miami, Coral Gables, USA","institution_ids":["https://openalex.org/I145608581"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22705152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"4","first_page":"785","last_page":"789"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.8344371914863586},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7284569144248962},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6522293090820312},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5952432751655579},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5273809432983398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5230358839035034},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5006182193756104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4785799980163574},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4526382386684418},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43741580843925476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4333762526512146},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3443043529987335}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.8344371914863586},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7284569144248962},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6522293090820312},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5952432751655579},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5273809432983398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5230358839035034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5006182193756104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4785799980163574},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4526382386684418},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43741580843925476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4333762526512146},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3443043529987335},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01954898","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01954898","pdf_url":null,"source":{"id":"https://openalex.org/S125499977","display_name":"BIT Numerical Mathematics","issn_l":"0006-3835","issn":["0006-3835","1572-9125"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BIT","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1697457270","https://openalex.org/W1965680834","https://openalex.org/W2002827932","https://openalex.org/W2007610503","https://openalex.org/W2017205387"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}