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.
2010
2010
Continuous and Discrete Methods in Computer Science.- Colorful Strips.- The Mono- and Bichromatic Empty Rectangle and Square… 
2008
2008
Vilka ar de sarskilda utmaningarna och problemen i socialvetenskaplig forskning? Vilka perspektiv och redskap kan anvandas da man… 
2007
2007
Among many graphs, directed acyclic graph (DAG) attracts many researchers due to its nice property of existence of topological… 
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
2000
Highly Cited
2000
. Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are… 
1993
1993
In process control applications, the bandwidth assigned to acyclic traffic is oversized in order to ensure that the time… 
Highly Cited
1991
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…