Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01240826n
Noun Concept
Categories: Graph algorithms, Spanning tree
EN
Borůvka's algorithm  Boruvka's algorithm  Boruvka algorithm  Boruvkas algorithm  Borůvka algorithm
EN
Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected. Wikipedia
Definitions
Relations
Sources
EN
Borůvka's algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected. Wikipedia
Algorithm for finding minimum spanning trees by repeatedly finding the shortest edge out of each subtree in a forest and adding all such edges to the forest Wikidata
DISCOVERER OR INVENTOR
Otakar Borůvka
NAMED AFTER
Otakar Borůvka
SOLVES
minimum spanning tree
Wikipedia
EN
Borůvka's algorithm
Wikidata
EN
Borůvka's algorithm
Wikipedia Redirections
EN
Boruvka's algorithm, Boruvka algorithm, Boruvkas algorithm, Borůvka algorithm, Sollin's algorithm, Sollins, Sollins algorithm
Wikidata Alias
EN
Sollin's algorithm

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License