Information | |
---|---|
has gloss | eng: In computer science, the problem of unrooted tree path lengths is that of finding the number of paths of each length in a tree. |
lexicalization | eng: Unrooted tree path lengths |
instance of | c/Computational problems in graph theory |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint