Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
his zum 14. Lebensjahre wenigstens 6977 Infektionsf~ille, also jeder bis zu seinem 14. Lebensjahre durchsehnittlieh 7mal mit Tbe… 
2005
2005
In the service-oriented architecture (SOA), we distinguish three roles of service owners: service providers, service requesters… 
Highly Cited
1998
Highly Cited
1998
Two new approaches are presented for the calculation of atom and bond parameters for heteroatom-containing molecules used in… 
Highly Cited
1997
Highly Cited
1986
Highly Cited
1986
We formulate the problem of query evaluatron over a relational database (EDB) supplemented by functronfree Horn clause rules (IDB… 
Highly Cited
1985
Highly Cited
1985
An application of the D-algorithm in generating tests for MOS circuit faults is described. The MOS circuits considered are… 
Highly Cited
1983
Highly Cited
1983
Nuclear Overhauser effects (NOE) and (CD) techniques have been used to probe \beta-turn conformations in acyclic and cyclic… 
Highly Cited
1980
Highly Cited
1980
6 z The concept of topological center is generalized for any connected acyclic or cyclic graph on the basis of the topological… 
Highly Cited
1972
Highly Cited
1972
THE skin of the apple cultivar ‘Sturmer Pippin’ contains one or more chloroform-soluble volatile substances which are highly… 
Highly Cited
1956
Highly Cited
1956
EinMtung Seitdem in den letzten 25 Jahren nach ]anger Vernachl~ssigung die Probleme der Assimilatfernleitung zu einem der…