Skip to search formSkip to main contentSkip to account menu

Directed acyclic graph

Known as: Directed acyclic graphs, Acyclic digraph, ADG 
In mathematics and computer science, a directed acyclic graph (DAG /ˈdæɡ/), is a finite directed graph with no directed cycles. That is, it consists… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We consider the problem of learning causal information between random variables in directed acyclic graphs (DAGs) when allowing… 
Highly Cited
2011
Highly Cited
2011
The investigation of directed acyclic graphs (DAGs) encoding the same Markov property, that is the same conditional independence… 
Highly Cited
2007
Highly Cited
2007
We consider the PC-algorithm (Spirtes et al., 2000) for estimating the skeleton and equivalence class of a very high-dimensional… 
Highly Cited
2006
Highly Cited
2006
We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions… 
Highly Cited
2003
Highly Cited
2003
We consider acycfic directed mixed graphs, in which directed edges (x->y) and bi-directed edges (x 4-+ y) may occur. A simple… 
Highly Cited
2003
Highly Cited
2003
  • J. Gross
  • Discrete Mathematics and Its Applications
  • 2003
  • Corpus ID: 34005336
Introduction to Graphs Fundamentals of Graph Theory, Jonathan L. Gross and Jay Yellen Families of Graphs and Digraphs, Lowell W… 
Highly Cited
2002
Highly Cited
2002
Presents a method of extending support vector machines (SVMs) for dealing with multiclass problems. Motivated by the decision… 
Highly Cited
2000
Highly Cited
2000
This article introduces a new inferential test for acyclic structural equation models (SEM) without latent variables or… 
Highly Cited
1998
Highly Cited
1998
We have been developing a theory for the generic representation of 2-D shape, where structural descriptions are derived from the… 
Highly Cited
1986
Highly Cited
1986
  • R. Bryant
  • IEEE transactions on computers
  • 1986
  • Corpus ID: 10385726
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms…