{"id":"https://openalex.org/W2073852371","doi":"https://doi.org/10.1016/0020-0190(78)90039-x","title":"A probabilistic minimum spanning tree algorithm","display_name":"A probabilistic minimum spanning tree algorithm","publication_year":1978,"publication_date":"1978-01-01","ids":{"openalex":"https://openalex.org/W2073852371","doi":"https://doi.org/10.1016/0020-0190(78)90039-x","mag":"2073852371"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(78)90039-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(78)90039-x","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5062254329","display_name":"F. James Rohlf","orcid":"https://orcid.org/0000-0003-0522-3679"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"F. James Rohlf","raw_affiliation_strings":["IBM Watson Research Center, P.O. Box 218, Yorktown Heights, N.Y. 10598 USA"],"affiliations":[{"raw_affiliation_string":"IBM Watson Research Center, P.O. Box 218, Yorktown Heights, N.Y. 10598 USA","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062254329"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.4809,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.81383648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"7","issue":"1","first_page":"44","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9919999837875366,"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/spanning-tree","display_name":"Spanning tree","score":0.7384772300720215},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6311290264129639},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6141006946563721},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5910560488700867},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5691423416137695},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5509339570999146},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4968307316303253},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48963433504104614},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4635538160800934},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4571937620639801},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4472999572753906},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.44568103551864624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33752694725990295},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2885311245918274},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22356274724006653}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7384772300720215},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6311290264129639},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6141006946563721},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5910560488700867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5691423416137695},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5509339570999146},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4968307316303253},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48963433504104614},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4635538160800934},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4571937620639801},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4472999572753906},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.44568103551864624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33752694725990295},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2885311245918274},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22356274724006653}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(78)90039-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(78)90039-x","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.9782","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.9782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://life.bio.sunysb.edu/ee/rohlf/Rohlf78-ProbMST.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1600795850","https://openalex.org/W1963503748","https://openalex.org/W1973942323","https://openalex.org/W1976060186","https://openalex.org/W1980653047","https://openalex.org/W2007610503","https://openalex.org/W2017927472","https://openalex.org/W2018359542","https://openalex.org/W2034024086","https://openalex.org/W2076232074","https://openalex.org/W2150518053","https://openalex.org/W2152506638","https://openalex.org/W2169528473","https://openalex.org/W2800875754","https://openalex.org/W2913066018","https://openalex.org/W3200447518","https://openalex.org/W4255469293","https://openalex.org/W6636070404","https://openalex.org/W6652286829","https://openalex.org/W6698813454","https://openalex.org/W6806421124","https://openalex.org/W6843108439","https://openalex.org/W7070665592"],"related_works":["https://openalex.org/W4387896093","https://openalex.org/W4380840098","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2387385213","https://openalex.org/W2589768050","https://openalex.org/W3016811403","https://openalex.org/W2130375301","https://openalex.org/W2418231958","https://openalex.org/W2138987445"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}