Results 11 to 20 of about 1,255,138 (288)
Acyclic Partitioning of Large Directed Acyclic Graphs [PDF]
Finding a good partition of a computational directed acyclic graph associated with an algorithm can help find an execution pattern improving data locality, conduct an analysis of data movement, and expose parallel steps. The partition is required to be acyclic, i.e., the inter-part edges between the vertices from different parts should preserve an ...
Herrmann, Julien +4 more
openaire +7 more sources
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs [PDF]
Summary: We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also known as the edge cut. The standard load balancing constraint of having an equitable partition of
Herrmann, Julien +4 more
core +6 more sources
Directed Acyclic Outerplanar Graphs Have Constant Stack Number [PDF]
The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological ...
Paul Jungeblut +2 more
doaj +3 more sources
Statistical tests for associations between two directed acyclic graphs. [PDF]
Biological data, and particularly annotation data, are increasingly being represented in directed acyclic graphs (DAGs). However, while relevant biological information is implicit in the links between multiple domains, annotations from these different ...
Robert Hoehndorf +3 more
doaj +2 more sources
The dawn of directed acyclic graphs in primary care research and education [PDF]
Hiroyoshi Iwata +2 more
doaj +2 more sources
Directed Acyclic Graphs With Tears
Bayesian network is a frequently-used method for fault detection and diagnosis in industrial processes. The basis of Bayesian network is structure learning which learns a directed acyclic graph (DAG) from data. However, the search space will scale super-exponentially with the increase of process variables, which makes the data-driven structure learning
Zhichao Chen 0001, Zhiqiang Ge
openaire +3 more sources
Copula Directed Acyclic Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pircalabelu, Eugen +2 more
openaire +3 more sources
Phasertng: directed acyclic graphs for crystallographic phasing [PDF]
Randy J Read +2 more
exaly +2 more sources
Evaluating topological ordering in directed acyclic graphs
Directed acyclic graphs are often used to model situations and problems in real life. If we consider the topological ordering of the graph as a process of arranging the vertices in the best possible way considering the constraints caused by the direction
Suzana Antunović, Damir Vukičević
doaj +1 more source
A directed acyclic graph for interactions [PDF]
Abstract Background Directed acyclic graphs (DAGs) are of great help when researchers try to understand the nature of causal relationships and the consequences of conditioning on different variables.
Anton Nilsson +3 more
openaire +2 more sources

