Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01240826n
Noun Concept
SYL
No term available
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
Relations
Sources
DISCOVERER OR INVENTOR
Otakar Boruvka
NAMED AFTER
Otakar Boruvka
SOLVES
EN
minimum spanning tree

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