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.
2002
2002
This paper presents a method, called Adaptive Directed Acyclic Graph (ADAG), to extend Support Vector Machines (SVMs) for… 
Highly Cited
1999
Highly Cited
1999
SummaryA kinetic model of formation of hyperbranched polymers by step polyaddition of a BAf monomer including cyclization was… 
Highly Cited
1996
Highly Cited
1996
This paper describes a unified approach to version control of documents and configurations. Hierarchical structure, which is… 
Highly Cited
1989
Highly Cited
1989
Abstract : Crystalline complexes of 1,10-dichloro-1,10-distannabicyclo.8. 8hexacosane and benzyltriphenylphosphonium chloride… 
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
1981
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
1980
Highly Cited
1980
Most marine and terrrestrial organisms and aquatic sediments contain sterols with an alkyl group at C-24. Assignment of the…