Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00972168n
Noun Concept
Categories: Directed acyclic graphs, Trees (graph theory)
EN
polytree  directed tree  oriented tree  polyforest  singly connected network
EN
In mathematics, and more specifically in graph theory, a polytree is a directed acyclic graph whose underlying undirected graph is a tree. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, and more specifically in graph theory, a polytree is a directed acyclic graph whose underlying undirected graph is a tree. Wikipedia
A directed graph without any undirected cycles Wikipedia Disambiguation
directed acyclic graph whose underlying undirected graph is a tree Wikidata
A graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either. Wiktionary
IS A
tree
directed acyclic graph
HAS KIND
arborescence
anti-arborescence
STUDIED BY
graph theory
Wikipedia
EN
polytree
Wikidata
EN
polytree
Wiktionary
EN
polytree
Wikipedia Redirections
EN
Oriented tree, polyforest
Wikidata Alias
EN
directed tree, oriented tree, singly connected network

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