Home › Entities › master_s_thesis › A formal correctness proof of Boruvka's minimum spanning tree algorithm.

A formal correctness proof of Boruvka's minimum spanning tree algorithm.

2020 master's thesis by Nicolas Robinson-O'Brien at University of Canterbury
CreativeWork master_s_thesis Q112953623
Press Enter · cited answer in seconds

A formal correctness proof of Boruvka's minimum spanning tree algorithm.

Summary

A formal correctness proof of Boruvka's minimum spanning tree algorithm. is a master's thesis[1].

Key Facts

  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s instance of is recorded as master's thesis[2].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm. was published by UC Research Repository[3].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s language of work or name is recorded as English[4].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s country of origin is recorded as New Zealand[5].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm. was published on 2020[6].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s main subject is computer science[7].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s title is recorded as A formal correctness proof of Boruvka's minimum spanning tree algorithm.[8].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s author name string is recorded as Nicolas Robinson-O'Brien[9].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s thesis submitted to is recorded as University of Canterbury[10].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s on focus list of Wikimedia project is recorded as NZThesisProject[11].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s copyright status is recorded as copyrighted[12].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s online access status is recorded as open access[13].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s thesis committee member is recorded as Walter Guttmann[14].
  • A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s thesis submitted for degree is recorded as Master of Science[15].

Body

Authorship and Creation

A formal correctness proof of Boruvka's minimum spanning tree algorithm. was published by UC Research Repository[3].

Publication

A formal correctness proof of Boruvka's minimum spanning tree algorithm. was released on 2020[6]. A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s language of work or name is recorded as English[4].

Subject and Themes

A formal correctness proof of Boruvka's minimum spanning tree algorithm.'s main subject is computer science[7].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). A formal correctness proof of Boruvka's minimum spanning tree algorithm.. Retrieved May 3, 2026, from https://4ort.xyz/entity/a-formal-correctness-proof-of-boruvka-s-minimum-spanning-tree-algorithm-
MLA “A formal correctness proof of Boruvka's minimum spanning tree algorithm..” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/a-formal-correctness-proof-of-boruvka-s-minimum-spanning-tree-algorithm-.
BibTeX @misc{4ortxyz_a-formal-correctness-proof-of-boruvka-s-minimum-spanning-tree-algorithm-_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A formal correctness proof of Boruvka's minimum spanning tree algorithm.}}, year = {2026}, url = {https://4ort.xyz/entity/a-formal-correctness-proof-of-boruvka-s-minimum-spanning-tree-algorithm-}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A formal correctness proof of Boruvka's minimum spanning tree algorithm. — https://4ort.xyz/entity/a-formal-correctness-proof-of-boruvka-s-minimum-spanning-tree-algorithm- (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/a-formal-correctness-proof-of-boruvka-s-minimum-spanning-tree-algorithm- · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 4w ago · DrThneed · 2026-09-06 view diff on Wikidata ↗
    Thesis submitted for degree → Master of Science
    Author name string → Nicolas Robinson-O'Brien
    Thesis submitted to → University of Canterbury
    Handle id → 10092/101132
    + 14 other properties edited (see Wikidata diff for full list)
    "/* wbeditentity-update:0| */ QuickStatements 3.0 [[:toollabs:qs-dev/batch/52330|batch #52330]]: Canterbury"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.