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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
05001000150019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We consider the PC-algorithm ([13]) for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with… (More)
  • table 4.1
  • table 4.2
  • table 4.3
  • table 4.4
  • table 4.5
Is this relevant?
2007
2007
This paper continues the line of research on the representation and compilation of propositional knowledge bases with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The generalized write-once memory introduced by Fiat and Shamir is a q-ary information storage medium. Each storage cell is… (More)
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Significant progress has recently been made in the design of efficient dynamic data structures for the representation of graphs… (More)
  • figure 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A graph-based modeling technique has been developed for the stochastic analysis of systems containing concurrency. The basis of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… (More)
  • figure 2
  • table 2
  • figure 11
Is this relevant?