Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01427142n
Noun Concept
ES
árbol k-ario  arbol k-ario
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
árbol con raíz
EN
ordered tree
EN
rose tree
HAS KIND
EN
and–or tree
EN
ternary tree
árbol binario
STUDIED BY
teoría de grafos
Wikidata
ES
árbol k-ario
Wikidata Alias
ES
arbol k-ario

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