{"id":"https://openalex.org/W3209152073","doi":"https://doi.org/10.1007/978-3-030-88701-8_14","title":"Relation-Algebraic Verification of\u00a0Bor\u016fvka\u2019s Minimum Spanning Tree\u00a0Algorithm","display_name":"Relation-Algebraic Verification of\u00a0Bor\u016fvka\u2019s Minimum Spanning Tree\u00a0Algorithm","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3209152073","doi":"https://doi.org/10.1007/978-3-030-88701-8_14","mag":"3209152073"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-88701-8_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-88701-8_14","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/A5071961816","display_name":"Walter Guttmann","orcid":"https://orcid.org/0000-0003-2969-1688"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Walter Guttmann","raw_affiliation_strings":["Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090769516","display_name":"Nicolas Robinson-O\u2019Brien","orcid":null},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Nicolas Robinson-O\u2019Brien","raw_affiliation_strings":["Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071961816"],"corresponding_institution_ids":["https://openalex.org/I185492890"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.22715351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9966999888420105,"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/correctness","display_name":"Correctness","score":0.9021121263504028},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7328729033470154},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6738828420639038},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5545015335083008},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5464996695518494},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5257875919342041},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5256054401397705},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5204813480377197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47389334440231323},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.46858853101730347},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4324966073036194},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4114147424697876},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.241420716047287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23090335726737976},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11499375104904175}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.9021121263504028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7328729033470154},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6738828420639038},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5545015335083008},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5464996695518494},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5257875919342041},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5256054401397705},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5204813480377197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47389334440231323},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.46858853101730347},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4324966073036194},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4114147424697876},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.241420716047287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23090335726737976},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11499375104904175},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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.1007/978-3-030-88701-8_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-88701-8_14","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":23,"referenced_works":["https://openalex.org/W1270205671","https://openalex.org/W1513400187","https://openalex.org/W1532446347","https://openalex.org/W1545329058","https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W2006006495","https://openalex.org/W2011721441","https://openalex.org/W2017927472","https://openalex.org/W2032841680","https://openalex.org/W2045111709","https://openalex.org/W2071346873","https://openalex.org/W2087216833","https://openalex.org/W2138304862","https://openalex.org/W2145680053","https://openalex.org/W2163152086","https://openalex.org/W2521096248","https://openalex.org/W2802771107","https://openalex.org/W2892302641","https://openalex.org/W3092543431","https://openalex.org/W3093321989","https://openalex.org/W4250846042","https://openalex.org/W4250930808"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W4380840098","https://openalex.org/W4242086819","https://openalex.org/W2899787781","https://openalex.org/W2074214908","https://openalex.org/W2381121915","https://openalex.org/W2418231958","https://openalex.org/W2390742649","https://openalex.org/W2130375301","https://openalex.org/W3016811403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}