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
2011
Highly Cited
2011
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
This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the… 
2002
2002
This paper presents a method, called Adaptive Directed Acyclic Graph (ADAG), to extend Support Vector Machines (SVMs) for… 
2001
2001
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators… 
1995
1995
In this paper we present two algorithms for building lexicons in Directed Acyclic Word-Graphs (DAWGs). The two algorithms, one… 
1994
1994
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
Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with… 
Highly Cited
1981