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)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

- Markus Kalisch, Peter Bühlmann
- Journal of Machine Learning Research
- 2007

We consider the PC-algorithm ([13]) for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with… (More)

Is this relevant?

2007

2007

- Michael Wachter, Rolf Haenni
- Canadian Conference on AI
- 2007

This paper continues the line of research on the representation and compilation of propositional knowledge bases with… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin
- J. Algorithms
- 2005

We study the problem of finding lowest common ancestors (LCA) in trees and directed acyclic graphs (DAGs). Specifically, we… (More)

Is this relevant?

2001

2001

- Carlos Cotta, José M. Troya
- Fuzzy Days
- 2001

This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators… (More)

Is this relevant?

2001

2001

- Patrick Healy, Nikola S. Nikolov
- Graph Drawing
- 2001

We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Fang-Wei Fu, A. J. Han Vinck
- IEEE Trans. Information Theory
- 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

- Kaleem Siddiqi, Ali Shokoufandeh, Sven J. Dickinson, Steven W. Zucker
- International Journal of Computer Vision
- 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

- Giuseppe F. Italiano
- Inf. Process. Lett.
- 1988

Significant progress has recently been made in the design of efficient dynamic data structures for the representation of graphs… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Robin A. Sahner, Kishor S. Trivedi
- IEEE Transactions on Software Engineering
- 1987

A graph-based modeling technique has been developed for the stochastic analysis of systems containing concurrency. The basis of… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Randal E. Bryant
- IEEE Transactions on Computers
- 1986

In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… (More)

Is this relevant?