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)

Related topics

Related topics

50 relations
Breadth-first searchCircuit (computer science)Coffman–Graham algorithmComputational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
A study and comparison of OLSR, AODV and TORA routing protocols in ad hoc networks
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to… 
Highly Cited
2006
Highly Cited
2006
SIMILARITY OF WEIGHTED DIRECTED ACYCLIC GRAPHS
This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the… 
Highly Cited
2003
Highly Cited
2003
Synthesis of Submicrometer-Sized CdS Hollow Spheres in Aqueous Solutions of a Triblock Copolymer
Submicrometer-sized hollow CdS spheres with a wall thickness of about 20 nm have been synthesized in aqueous solutions of cadmium… 
2002
2002
Adaptive Directed Acyclic Graphs for Multiclass Classification
This paper presents a method, called Adaptive Directed Acyclic Graph (ADAG), to extend Support Vector Machines (SVMs) for… 
Highly Cited
1999
Highly Cited
1999
A new tripodal anion receptor with CH···X− hydrogen bonding
1994
1994
Generalized multiprocessor scheduling for directed acyclic graphs
In the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 216-228 (JuIy 1991), we presented several new… 
Highly Cited
1992
Highly Cited
1992
Optimal Reductions of Two-Terminal Directed Acyclic Graphs
Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with… 
1984
1984
A parallel search algorithm for directed acyclic graphs
A parallel algorithm for depth-first searching of a directed acyclic graph (DAG) on a shared memory model of a SIMD computer is… 
Highly Cited
1981
Highly Cited
1981
Enantioselective alkylation of chiral enolates
Highly Cited
1974
Highly Cited
1974
Gas-chromatographic analysis of sugars and related hydroxy acids as acyclic oxime and ester trimethylsilyl derivatives
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)