{"id":"https://openalex.org/W135887360","doi":"https://doi.org/10.1007/3-540-16761-7_92","title":"A parallel vertex insertion algorithm for minimum spanning trees","display_name":"A parallel vertex insertion algorithm for minimum spanning trees","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W135887360","doi":"https://doi.org/10.1007/3-540-16761-7_92","mag":"135887360"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-16761-7_92","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-16761-7_92","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5081334414","display_name":"Peter Varman","orcid":"https://orcid.org/0000-0001-6887-1644"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peter Varman","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Rice University, 77001, Houston, Texas, USA","**Rice University;"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Rice University, 77001, Houston, Texas, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"**Rice University;","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016173449","display_name":"Kshitij Doshi","orcid":"https://orcid.org/0000-0002-1927-3995"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kshitij Doshi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Rice University, 77001, Houston, Texas, USA","**Rice University;"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Rice University, 77001, Houston, Texas, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"**Rice University;","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081334414"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.945,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.72340426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"424","last_page":"433"},"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.9991999864578247,"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.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.6917436718940735},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6548977494239807},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6111453771591187},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.557012677192688},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5244024991989136},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5060276389122009},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.46899986267089844},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45878201723098755},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45752227306365967},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4573788344860077},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.442605197429657},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4320610463619232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2649543285369873},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17951688170433044}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6917436718940735},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6548977494239807},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6111453771591187},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.557012677192688},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5244024991989136},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5060276389122009},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.46899986267089844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45878201723098755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45752227306365967},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4573788344860077},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.442605197429657},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4320610463619232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2649543285369873},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17951688170433044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-16761-7_92","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-16761-7_92","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W88123203","https://openalex.org/W198890980","https://openalex.org/W2004090025","https://openalex.org/W2020810308","https://openalex.org/W2038643780","https://openalex.org/W2058557216","https://openalex.org/W2069446854","https://openalex.org/W2071845176","https://openalex.org/W2160907067","https://openalex.org/W2752780818","https://openalex.org/W4285719527","https://openalex.org/W6664889253"],"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":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}