Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03456716n
Noun Concept
FR
No term available
EN
The distributed minimum spanning tree problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. Wikipedia
Relations
Sources
IS A
algorithme réparti

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