e/Unrooted tree path lengths

New Query

Information
has glosseng: In computer science, the problem of unrooted tree path lengths is that of finding the number of paths of each length in a tree.
lexicalizationeng: Unrooted tree path lengths
instance ofc/Computational problems in graph theory

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint