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.
2017
2017
In this work, we present a compact, modular framework for constructing new recurrent neural architectures. Our basic module is a… 
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… 
1997
1997
This paper presents a flow approximation of production networks with finite buffers and unreliable machines. Parts of various… 
Highly Cited
1991
Highly Cited
1991
1989
1989
The truncated expansion of a function ¦x¦ is used to obtain the total Hückel π-electron energy partitioned into various sums, in… 
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… 
1972
1972
ZusammenfassungIn der vorliegenden Arbeit wurde der Schmelzbruch darauf zurückgeführt, daß im Düseneinlauf eine kritische… 
1959
1959
Introduction. Throughout the following X will denote a metric continuum, 2X the set of all nonempty closed subsets of X and C(X…