Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,977,334 papers from all fields of science
Search
Sign In
Create Free Account
Directed acyclic graph
Known as:
Directed acyclic graphs
, Acyclic digraph
, ADG
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Breadth-first search
Circuit (computer science)
Coffman–Graham algorithm
Computational geometry
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings
A. López-Ortiz
Lecture Notes in Computer Science
2010
Corpus ID: 31153020
Continuous and Discrete Methods in Computer Science.- Colorful Strips.- The Mono- and Bichromatic Empty Rectangle and Square…
Expand
Highly Cited
2006
Highly Cited
2006
Die Tierwelt Deutschlands und der angrenzenden Meeresteile
Stellwaag
Anzeiger für Schädlingskunde
2006
Corpus ID: 37383862
his zum 14. Lebensjahre wenigstens 6977 Infektionsf~ille, also jeder bis zu seinem 14. Lebensjahre durchsehnittlieh 7mal mit Tbe…
Expand
2004
2004
Das Carotinoidmuster und die Verbreitung des lichtinduzierten Xanthophyllcyclus in verschiedenen Algenklassen
H. Stransky
,
A. Hager
Archiv für Mikrobiologie
2004
Corpus ID: 39370563
SummaryThe pigments of some blue-green and red algae have been identified and quantitatively determined by methods discussed in…
Expand
Highly Cited
1997
Highly Cited
1997
Asymmetric [2,3]-Wittig rearrangement as a general tool for asymmetric synthesis
T. Nakai
,
K. Tomooka
1997
Corpus ID: 95899400
Abstract
Highly Cited
1991
Highly Cited
1991
Acyclic Organonitrogen Stereodynamics
J. B. Lambert
,
竹内 敬人
1991
Corpus ID: 94454560
Highly Cited
1986
Highly Cited
1986
A message passing framework for logical query evaluation
A. Van Gelder
ACM SIGMOD Conference
1986
Corpus ID: 15853197
We formulate the problem of query evaluatron over a relational database (EDB) supplemented by functronfree Horn clause rules (IDB…
Expand
Highly Cited
1985
Highly Cited
1985
Modeling and Test Generation Algorithms for MOS Circuits
Sunil K. Jain
,
V. Agrawal
IEEE transactions on computers
1985
Corpus ID: 3003981
An application of the D-algorithm in generating tests for MOS circuit faults is described. The MOS circuits considered are…
Expand
Highly Cited
1983
Highly Cited
1983
Nuclear Overhauser Effects and circular Dichroism as Probes of \beta.-turn Conformations in Acyclic and Cyclic Peptides with Pro-X Sequences
B. Rao
,
Anilesh Kumar
,
H. Balaram
,
A. Ravi
,
P. Balaram
1983
Corpus ID: 55518721
Nuclear Overhauser effects (NOE) and (CD) techniques have been used to probe \beta-turn conformations in acyclic and cyclic…
Expand
Highly Cited
1980
Highly Cited
1980
Generalization of the Graph Center Concept, and Derived Topological Centric Indexes
D. Bonchev
,
A. Balaban
,
O. Mekenyan
Journal of chemical information and computer…
1980
Corpus ID: 3277479
6 z The concept of topological center is generalized for any connected acyclic or cyclic graph on the basis of the topological…
Expand
1975
1975
Faithful Representation of a Family of Sets by a Set of Intervals
K. Eswaran
SIAM journal on computing (Print)
1975
Corpus ID: 29487754
Let $Q = \{ q_1 ,q_2 , \cdots ,q_m \} $ be a family of finite, nonempty sets, and $S = \cup_{q_i \in Q} \{ q_i \} $. Suppose…
Expand