Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,756 papers from all fields of science
Search
Sign In
Create Free Account
Directed acyclic graph
Known as:
Directed acyclic graphs
, Acyclic digraph
, ADG
Expand
In mathematics and computer science, a directed acyclic graph (DAG /ˈdæɡ/), is a finite directed graph with no directed cycles. That is, it consists…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Breadth-first search
Circuit (computer science)
Coffman–Graham algorithm
Computational geometry
Expand
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
P. Kuppusamy
,
K. Thirunavukkarasu
,
B. Kalaavathi
International Conference on Electronic Computer…
2011
Corpus ID: 16008919
Mobile Ad hoc Network (MANET) is a collection of mobile nodes in which the wireless links are frequently broken down due to…
Expand
Highly Cited
2006
Highly Cited
2006
SIMILARITY OF WEIGHTED DIRECTED ACYCLIC GRAPHS
Jing Jin
,
V. Bhavsar
,
S. Prasad
,
B. K. Sarker
2006
Corpus ID: 17128180
This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the…
Expand
2002
2002
Adaptive Directed Acyclic Graphs for Multiclass Classification
B. Kijsirikul
,
Nitiwut Ussivakul
,
Surapant Meknavin
Pacific Rim International Conference on…
2002
Corpus ID: 38700448
This paper presents a method, called Adaptive Directed Acyclic Graph (ADAG), to extend Support Vector Machines (SVMs) for…
Expand
2001
2001
Analyzing Directed Acyclic Graph Recombination
C. Cotta
,
J. M. Troya
Fuzzy Days
2001
Corpus ID: 8105611
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators…
Expand
Highly Cited
1999
Highly Cited
1999
A new tripodal anion receptor with CH···X− hydrogen bonding
Kiyoshi Sato
,
S. Arai
,
T. Yamagishi
1999
Corpus ID: 8985127
1995
1995
Two Algorithms for Incremental Construction of Directed Acyclic Word Graphs
K. Sgarbas
,
N. Fakotakis
,
G. Kokkinakis
Int. J. Artif. Intell. Tools
1995
Corpus ID: 28162507
In this paper we present two algorithms for building lexicons in Directed Acyclic Word-Graphs (DAWGs). The two algorithms, one…
Expand
1994
1994
Generalized multiprocessor scheduling for directed acyclic graphs
G. N. S. Prasanna
,
B. Musicus
Proceedings of Supercomputing '94
1994
Corpus ID: 6012264
In the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 216-228 (JuIy 1991), we presented several new…
Expand
Highly Cited
1992
Highly Cited
1992
Optimal Reductions of Two-Terminal Directed Acyclic Graphs
W. Bein
,
J. Kamburowski
,
Matthias F. Stallmann
SIAM journal on computing (Print)
1992
Corpus ID: 26659409
Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with…
Expand
Highly Cited
1981
Highly Cited
1981
Enantioselective alkylation of chiral enolates
D. A. Evans
,
J. M. Takacs
1981
Corpus ID: 93924696
Highly Cited
1974
Highly Cited
1974
Gas-chromatographic analysis of sugars and related hydroxy acids as acyclic oxime and ester trimethylsilyl derivatives
G. Peterson
1974
Corpus ID: 33759177
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)
ACCEPT & CONTINUE