In graph theory, a polytree is a directed graph with at most one undirected path between any two vertices. In other words, a polytree is a directed acyclic graph (DAG) for which there are no undirected cycles either. Equivalently, a polytree is a directed graph formed by giving a direction to each edge of a forest. The name "polytree" was coined by Rebane & Pearl (1987); polytrees have also been referred to as singly connected networks and oriented trees.
| Property | Value |
|---|
| dbpedia-owl:abstract
|
- In graph theory, a polytree is a directed graph with at most one undirected path between any two vertices. In other words, a polytree is a directed acyclic graph (DAG) for which there are no undirected cycles either. Equivalently, a polytree is a directed graph formed by giving a direction to each edge of a forest. The name "polytree" was coined by Rebane & Pearl (1987); polytrees have also been referred to as singly connected networks and oriented trees.
|
| dbpedia-owl:thumbnail
| |
| dcterms:subject
| |
| rdf:type
| |
| rdfs:comment
|
- In graph theory, a polytree is a directed graph with at most one undirected path between any two vertices. In other words, a polytree is a directed acyclic graph (DAG) for which there are no undirected cycles either. Equivalently, a polytree is a directed graph formed by giving a direction to each edge of a forest. The name "polytree" was coined by Rebane & Pearl (1987); polytrees have also been referred to as singly connected networks and oriented trees.
|
| rdfs:label
| |
| owl:sameAs
| |
| foaf:depiction
| |
| foaf:page
| |
| is dbpedia-owl:wikiPageRedirects
of | |
| is owl:sameAs
of | |
| is foaf:primaryTopic
of | |
