{"id":"https://openalex.org/W2089290774","doi":"https://doi.org/10.1007/bf02526037","title":"A simpler minimum spanning tree verification algorithm","display_name":"A simpler minimum spanning tree verification algorithm","publication_year":1997,"publication_date":"1997-06-01","ids":{"openalex":"https://openalex.org/W2089290774","doi":"https://doi.org/10.1007/bf02526037","mag":"2089290774"},"language":"en","primary_location":{"id":"doi:10.1007/bf02526037","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02526037","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5110426531","display_name":"Valerie King","orcid":"https://orcid.org/0000-0001-5138-6925"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"V. King","raw_affiliation_strings":["Department of Computer Science, University of Victoria, V8W 3P6, Victoria, British Columbia, Canada","Department of Computer Science, University of Victoria, Victoria, Canada, V8W 3P6#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Victoria, V8W 3P6, Victoria, British Columbia, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"Department of Computer Science, University of Victoria, Victoria, Canada, V8W 3P6#TAB#","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110426531"],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.315,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.93984824,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"18","issue":"2","first_page":"263","last_page":"270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.8634999990463257,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.8634999990463257,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.8550000190734863,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.8366000056266785,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.6940594911575317},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6584367752075195},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6051347255706787},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5873159170150757},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5728814601898193},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5523090958595276},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5436136722564697},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.529832661151886},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.49194857478141785},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48349812626838684},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.46648648381233215},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.44257885217666626},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.4229673147201538},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.41057050228118896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40348607301712036},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3658181428909302},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17171943187713623},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1225893497467041},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.0664236843585968}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6940594911575317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6584367752075195},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6051347255706787},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5873159170150757},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5728814601898193},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5523090958595276},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5436136722564697},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.529832661151886},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.49194857478141785},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48349812626838684},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.46648648381233215},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.44257885217666626},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.4229673147201538},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.41057050228118896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40348607301712036},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3658181428909302},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17171943187713623},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1225893497467041},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0664236843585968},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/bf02526037","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02526037","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.4417","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.4417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csr.uvic.ca/~val/Publications/WADS95-MSTverif.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.2718","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.2718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu:80/courses/archive/fall09/cos521/Handouts/simplerminimum.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.6399","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/courses/archive/fall05/cos528/handouts/A%20Simpler%20Minimum.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.6311","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.6311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csr.uvic.ca/~val/Publications/MSTv.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1978099551","https://openalex.org/W2011999472","https://openalex.org/W2023658462","https://openalex.org/W2046946959","https://openalex.org/W2138304862","https://openalex.org/W2152506249"],"related_works":["https://openalex.org/W193918669","https://openalex.org/W2045244794","https://openalex.org/W1991082127","https://openalex.org/W2163139704","https://openalex.org/W2058966397","https://openalex.org/W2008581797","https://openalex.org/W2121482491","https://openalex.org/W2090677255","https://openalex.org/W2063925363","https://openalex.org/W2089290774"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}