There lies a network structure between fixed tree and minimum cost spanning tree networks that has not been previously analyzed from a cooperative game theoretic perspective, namely, directed acyclic graph (DAG) networks. In this paper we consider the cost allocation game defined on DAG-networks. We briefly discuss the relation of DAG-games with other networkbased cost games. We demonstrate tha...

The essence of the Bayesian network model is largely embodied by its structural component: a directed acyclic graph (DAG). A DAG encodes assertions of conditional independence, whereas the remaining model parameters specify the actual local conditional distributions. The DAG plays an important role, for instance, in causal discovery and inference, where the DAG is interpreted as a representatio...

Diacylglycerols (DAG) modulate secretory responses by the activation of protein kinase C. Early changes in DAG formation induced by the muscarinic receptor agonist carbachol were compared to those caused by the nutrient secretagogue glucose in pancreatic islets. Turnover rates of DAG were investigated in radiolabeling experiments, whereas changes in total mass and fatty acid composition of DAG ...

An algorithm for generating the structure of a directed acyclic graph from data using the notion of causal input lists is prest'nted. The algorithm manipulates the ordt'ring of the variables with operations which very much resemble arc reversal. Operations are only applied if the DAG after the operation repre­ sents at least the independencies represented by the DAG before the operation until n...

We generalise the insertion into a binary heap to any directed acyclic graph (DAG) with one source vertex. This lets us formulate a general method for converting any such DAG into a data structure with priority queue interface. We apply our method to a hypercube DAG to obtain a sorting algorithm of complexity $\mathcal{O}(n\log^2 (n))$. As another curious application, we derive a relationship b...

The activities, in project scheduling, can be represented graphically in two different ways, by either assigning the activities to the nodes ‘AoN’ directed acyclic graph (dag) or to the arcs ‘AoA dag’. In this paper, a new algorithm is proposed for generating, for a given project scheduling problem, an Activity-on-Arc dag starting from the Activity-on-Node dag using the concepts of line graphs ...

Berwanger et al. show in [BDH+12] that for every graph G of size n and DAGwidth k there is a DAG decomposition of width k of size nO(k). This gives a polynomial time algorithm for determining the DAG-width of a graph for any fixed k. However, if the DAG-width of the graphs from a class is not bounded, such algorithms become exponential. This raises the question whether we can always find a DAG ...

Guanine nucleotide exchange factors (GEFs) activate Ras by facilitating its GTP binding. Ras guanyl nucleotide-releasing protein (GRP) was recently identified as a Ras GEF that has a diacylglycerol (DAG)-binding C1 domain. Its exchange factor activity is regulated by local availability of signaling DAG. DAG kinases (DGKs) metabolize DAG by converting it to phosphatidic acid. Because they can at...

Diacylglycerol (DAG) may undergo differential metabolism compared with triacylglycerol (TAG) in humans, possibly resulting in decreased serum TAG concentration and TAG synthesis and increased energy expenditure (EE), thus reducing fat accumulation. Our objective was to examine the efficacy of DAG oil (Enova oil) consumption on serum lipid profiles, hepatic lipogenesis, EE, and body weight and c...