Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,718,638 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.
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
2005
2005
Operating guidelines - an automata-theoretic foundation for the service-oriented architecture
Peter Massuthe
,
K. Wolf
International Conference on Quality Software
2005
Corpus ID: 7549348
In the service-oriented architecture (SOA), we distinguish three roles of service owners: service providers, service requesters…
Expand
Highly Cited
1998
Highly Cited
1998
Design of Topological Indices. Part 10.1 Parameters Based on Electronegativity and Covalent Radius for the Computation of Molecular Graph Descriptors for Heteroatom-Containing Molecules
O. Ivanciuc
,
T. Ivanciuc
,
A. Balaban
Journal of chemical information and computer…
1998
Corpus ID: 10687438
Two new approaches are presented for the calculation of atom and bond parameters for heteroatom-containing molecules used 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
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
Highly Cited
1972
Highly Cited
1972
α-Farnesene, a Natural Attractant for Codling Moth Larvae
O. Sutherland
,
R. Hutchins
Nature
1972
Corpus ID: 4205244
THE skin of the apple cultivar ‘Sturmer Pippin’ contains one or more chloroform-soluble volatile substances which are highly…
Expand
Highly Cited
1956
Highly Cited
1956
Untersuchungen Über die Leitung und Sekretion der Assimilate
H. Ziegler
Planta
1956
Corpus ID: 9131803
EinMtung Seitdem in den letzten 25 Jahren nach ]anger Vernachl~ssigung die Probleme der Assimilatfernleitung zu einem der…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE