Examples of directed acyclic graphs in increasing levels of structural strictness.
- Michele Coscia (621455)
Publication date
January 2018
DOIAbstract
<p>From left to right: a directed acyclic graph, a tree, and an arborescence.</p
<p>From left to right: a directed acyclic graph, a tree, and an arborescence.</p
Acyclic subdigraphs and linear orderings : polytopes, facets and a cutting plane algorithm / Martin ...
AbstractIn this paper, we propose that structural learning of a directed acyclic graph can be decomp...
<p>Directed acyclic graph showing the framework of Mendelian randomization analyses in this study.</...
This letter gives a new necessary and sufficient condition to determine whether a directed graph is ...
<p>From left to right: a balanced arborescence with height = 3 and branching factor = 2; a wheel gra...
textabstractA characterization is given for acyclic digraphs that are the acyclic intersection digra...
<p>The branch shows the containment relationships of GO terms. The GO term with a deeper color repre...
AbstractA characterization is given for acyclic digraphs that are the acyclic intersection digraphs ...
<p>Directed acyclic graph, the arrows in blue and red denote the relations that confound the causal ...
Directed acyclic graph considered for the selection of confounding variables in the regression model...
AbstractThose directed trees which are determined up to isomorphism by their demi-degrees are charac...
In this paper, we propose that structural learning of a directed acyclic graph can be decomposed int...
Acyclic subdigraphs and linear oderings : polytopes, facets and a cutting plane algorithm / Martin G...
Acyclic subdigraphs and linear orderings : polytopes, facets and a cutting plane algorithm / Martin ...
The concept of graph theory is therefore perfectly suitable to structure a problem in its initial an...
Acyclic subdigraphs and linear orderings : polytopes, facets and a cutting plane algorithm / Martin ...
AbstractIn this paper, we propose that structural learning of a directed acyclic graph can be decomp...
<p>Directed acyclic graph showing the framework of Mendelian randomization analyses in this study.</...
This letter gives a new necessary and sufficient condition to determine whether a directed graph is ...
<p>From left to right: a balanced arborescence with height = 3 and branching factor = 2; a wheel gra...
textabstractA characterization is given for acyclic digraphs that are the acyclic intersection digra...
<p>The branch shows the containment relationships of GO terms. The GO term with a deeper color repre...
AbstractA characterization is given for acyclic digraphs that are the acyclic intersection digraphs ...
<p>Directed acyclic graph, the arrows in blue and red denote the relations that confound the causal ...
Directed acyclic graph considered for the selection of confounding variables in the regression model...
AbstractThose directed trees which are determined up to isomorphism by their demi-degrees are charac...
In this paper, we propose that structural learning of a directed acyclic graph can be decomposed int...
Acyclic subdigraphs and linear oderings : polytopes, facets and a cutting plane algorithm / Martin G...
Acyclic subdigraphs and linear orderings : polytopes, facets and a cutting plane algorithm / Martin ...
The concept of graph theory is therefore perfectly suitable to structure a problem in its initial an...
Acyclic subdigraphs and linear orderings : polytopes, facets and a cutting plane algorithm / Martin ...
AbstractIn this paper, we propose that structural learning of a directed acyclic graph can be decomp...
<p>Directed acyclic graph showing the framework of Mendelian randomization analyses in this study.</...
Add to ORKG