Directed Acyclic Graphs
Directed Acyclic Graphs is a graphical model consisting of directed edges and nodes that represents causal relationships among variables, distinguished by the absence of directed cycles to ensure temporally consistent causal ordering.
11.4K
Publications
576.3K
Citations
13.3K
Authors
3.1K
Institutions
Publications per year
2017–2026
1.6K
11.4K
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
The Graph Neural Network Model
Franco Scarselli, M. Gori, Ah Chung Tsoi et al. · IEEE Transactions on Neural Networks · 2008 · 9.3K citations · Full text
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
1–5 of 11.4K
13.3K
34
h-index
31
h-index
29
h-index
28
h-index
26
h-index
1–5 of 13.3K
3.1K

University of Waterloo
Waterloo, Canada
53 h-index
253 publications
14.8K citations

Centre National de la Recherche Scientifique
Paris, France
48 h-index
433 publications
16.1K citations

Hungarian Academy of Sciences
Budapest, Hungary
45 h-index
204 publications
10.8K citations

Tel Aviv University
Tel Aviv, Israel
45 h-index
174 publications
11.6K citations
Carnegie Mellon University
Pittsburgh, United States
44 h-index
204 publications
24.1K citations
Princeton University
Princeton, United States
42 h-index
144 publications
10.6K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
40 h-index
147 publications
8.7K citations
Massachusetts Institute of Technology
Cambridge, United States
38 h-index
136 publications
10K citations
1–8 of 3.1K
500 publications · 26.7K citations
79
h-index
1.1K publications · 36.8K citations
77
h-index
608 publications · 20.3K citations
66
h-index
548 publications · 17.8K citations
61
h-index
86 publications · 16.8K citations
50
h-index
1–5