Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
MapReduce and its variants have been highly successful in implementing large-scale data-intensive applications on commodity… Expand
  • figure 1
  • figure 2
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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Highly Cited
2005
Highly Cited
2005
We study the problem of finding lowest common ancestors (LCA) in trees and directed acyclic graphs (DAGs). Specifically, we… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
We have been developing a theory for the generic representation of 2-D shape, where structural descriptions are derived from the… Expand
  • figure 5
  • figure 7
  • figure 9
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… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2002
Highly Cited
2002
Presents a method of extending support vector machines (SVMs) for dealing with multiclass problems. Motivated by the decision… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Highly Cited
2000
Highly Cited
2000
This article introduces a new inferential test for acyclic structural equation models (SEM) without latent variables or… Expand
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… Expand
  • figure 2
  • table 2
  • figure 11
Highly Cited
1980
Highly Cited
1980
The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6