Results 31 to 40 of about 1,255,138 (288)
The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs
The Electronic Journal of Combinatorics, 2022 Let $H$ be a directed acyclic graph (dag) that is not a rooted star. It is known that there are constants $c=c(H)$ and $C=C(H)$ such that the following holds for $D_n$, the complete directed graph on $n$ vertices. There is a set of at most $C\log n$ directed acyclic subgraphs of $D_n$ that covers every $H$-copy of $D_n$, while every set of at most $c ...
openaire +2 more sources
DAGmaps: Space Filling Visualization of Directed Acyclic Graphs
Journal of Graph Algorithms and Applications, 2009 Gene Ontology information related to the biological role of genes is organized in a hierarchical manner that can be represented by a directed acyclic graph (DAG).
Vassilis Tsiaras +2 more
doaj +1 more source
Qualitative Approximations to Causality: Non-Randomizable Factors in Clinical Psychology
Clinical Psychology in Europe, 2021 [Background] Causal quests in non-randomized studies are unavoidable just because research questions are beyond doubt causal (e.g., aetiology). Large progress during the last decades has enriched the methodical toolbox. [Aims] Summary papers mainly focus
Michael Höfler +2 more
doaj +1 more source
Generalized Layerings for Arbitrary and Fixed Drawing Areas
Journal of Graph Algorithms and Applications, 2017 The Directed Layering Problem (DLP) solves a step of the widely used layer-based approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, usually a preprocessing step is used that solves the Feedback Arc Set Problem (FASP) to ...
Ulf Rüegg +3 more
doaj +1 more source
Decision-theoretic foundations for statistical causality: Response to Pearl
Journal of Causal Inference, 2022 I thank Judea Pearl for his discussion of my paper and respond to the points he raises. In particular, his attachment to unaugmented directed acyclic graphs has led to a misapprehension of my own proposals. I also discuss the possibilities for developing
Dawid Philip
doaj +1 more source
On compact directed acyclic word graphs [PDF]
, 1997 The Directed Acyclic Word Graph (DAWG) is a space-efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in the length of the string on a fixed alphabet.
Crochemore, Maxime, Vérin, Renaud
openaire +3 more sources
Directed acyclic graphs: A tool to identify confounders in orthodontic research, Part II [PDF]
, 2017 In the previous article, we discussed the problem of confounding and presented 3 fundamental methods for assessing and adjusting for confounders: the traditional approach, the noncollapsibility approach, and the directed acyclic graphs (DAGs) or causal ...
Thikriat S. Al-Jewair +5 more
core +2 more sources
MRC Directed Acyclic Graphs for Mendelian Randomisation
, 2022 MRC Directed Acyclic Graphs for Mendelian ...
Nay Aung (11874419)
core +1 more source
DIGRUNDY NUMBER OF DIRECTED STAR, BANANA TREE, FIREWORKS, AND COCONUT TREE GRAPHS
BarekengA digrundy coloring of a graph is a vertex coloring in which every vertex assigned a higher color is adjacent to vertices assigned all smaller colors. The maximum number of colors that can be realized in such a coloring of an acyclic directed graph is ...
Raventino Raventino, Fransiskus Fran
doaj +1 more source
Ternary directed acyclic word graphs
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Satoru Miyamoto +3 more
openaire +4 more sources