Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01427142n
Noun Concept
PT
No term available
EN
In graph theory, an m-ary tree is an arborescence in which each node has no more than m children. Wikipedia
Relations
Sources
IS A
árvore enraizada
árvore ordenada
EN
rose tree
HAS KIND
EN
and–or tree
EN
ternary tree
árvore binária
STUDIED BY
teoria dos grafos

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