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

Related topics

Related topics

50 relations
Breadth-first searchCircuit (computer science)Coffman–Graham algorithmComputational geometry
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Decentralized Consensus for Edge-Centric Internet of Things: A Review, Taxonomy, and Research Issues
With the exponential rise in the number of devices, the Internet of Things (IoT) is geared toward edge-centric computing to offer… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A Linear Non-Gaussian Acyclic Model for Causal Discovery
In recent years, several methods have been proposed for the discovery of causal structure from non-experimental data. Such… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm
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
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Lowest common ancestors in trees and directed acyclic graphs
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
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Markov Properties for Acyclic Directed Mixed Graphs
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
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Shock Graphs and Shape Matching
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
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Graph-Based Algorithms for Boolean Function Manipulation
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
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
An article of golfing equipment has a golf tee attached to a spring-biassed reel by a length of string. The reel is mounted in a… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1983
Highly Cited
1983
On the Desirability of Acyclic Database Schemes
A class of database schemes, called acychc, was recently introduced. It is shown that this class has a number of desirable… Expand
  • figure 1
  • figure 3
  • figure 6
  • figure 9
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Algorithms for Acyclic Database Schemes
Many real-world situations can be captured by a set of functional dependencies and a single join dependency of a particular form… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE