{"id":"https://openalex.org/W2521096248","doi":"https://doi.org/10.1007/978-3-319-46750-4_4","title":"Relation-Algebraic Verification of Prim\u2019s Minimum Spanning Tree Algorithm","display_name":"Relation-Algebraic Verification of Prim\u2019s Minimum Spanning Tree Algorithm","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2521096248","doi":"https://doi.org/10.1007/978-3-319-46750-4_4","mag":"2521096248"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-46750-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-46750-4_4","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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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":1.6931,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85410588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9980999827384949,"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/correctness","display_name":"Correctness","score":0.810462474822998},{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.7566516399383545},{"id":"https://openalex.org/keywords/hoare-logic","display_name":"Hoare logic","score":0.7129679322242737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6195290684700012},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5928434133529663},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5173794031143188},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.47609126567840576},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4502042829990387},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.44724905490875244},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4225428104400635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4104973375797272},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35823991894721985},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3360501527786255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32068416476249695},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19693523645401}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.810462474822998},{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.7566516399383545},{"id":"https://openalex.org/C104949639","wikidata":"https://www.wikidata.org/wiki/Q1375924","display_name":"Hoare logic","level":3,"score":0.7129679322242737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6195290684700012},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5928434133529663},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5173794031143188},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.47609126567840576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4502042829990387},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.44724905490875244},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4225428104400635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4104973375797272},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35823991894721985},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3360501527786255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32068416476249695},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19693523645401},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-46750-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-46750-4_4","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W176706912","https://openalex.org/W578709777","https://openalex.org/W836255558","https://openalex.org/W956848902","https://openalex.org/W1270205671","https://openalex.org/W1513400187","https://openalex.org/W1519644068","https://openalex.org/W1532446347","https://openalex.org/W1545329058","https://openalex.org/W1570949334","https://openalex.org/W1571615440","https://openalex.org/W1574773091","https://openalex.org/W1588115473","https://openalex.org/W1674186056","https://openalex.org/W1788771336","https://openalex.org/W1965680834","https://openalex.org/W1970672922","https://openalex.org/W1973942323","https://openalex.org/W1981755382","https://openalex.org/W1987172788","https://openalex.org/W1999128250","https://openalex.org/W2006006495","https://openalex.org/W2011721441","https://openalex.org/W2017927472","https://openalex.org/W2022589543","https://openalex.org/W2032028343","https://openalex.org/W2032841680","https://openalex.org/W2044540217","https://openalex.org/W2045111709","https://openalex.org/W2045246689","https://openalex.org/W2045528636","https://openalex.org/W2054416947","https://openalex.org/W2055560858","https://openalex.org/W2056240511","https://openalex.org/W2071346873","https://openalex.org/W2087216833","https://openalex.org/W2095363060","https://openalex.org/W2106192381","https://openalex.org/W2106613801","https://openalex.org/W2118914950","https://openalex.org/W2134831148","https://openalex.org/W2138304862","https://openalex.org/W2138414916","https://openalex.org/W2145680053","https://openalex.org/W2160633550","https://openalex.org/W2163152086","https://openalex.org/W2169528473","https://openalex.org/W2404395636","https://openalex.org/W2578782373","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4234122916","https://openalex.org/W4236154909","https://openalex.org/W4247557026","https://openalex.org/W4250846042","https://openalex.org/W4250930808"],"related_works":["https://openalex.org/W1545329058","https://openalex.org/W23903359","https://openalex.org/W1527597986","https://openalex.org/W1491368825","https://openalex.org/W34452851","https://openalex.org/W4283765998","https://openalex.org/W1997440650","https://openalex.org/W2022828482","https://openalex.org/W2390801585","https://openalex.org/W2051756765"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
