Directed Graphs
A Directed Graph is a mathematical structure consisting of a set of vertices and a set of ordered pairs of vertices called directed edges, which indicate asymmetric relationships between vertices, distinguishing it from undirected graphs where edges lack orientation.
1.4K
Publications
89.9K
Citations
2.9K
Authors
1K
Institutions
Publications per year
2017–2026
330
Parents
1.4K
Asymmetric Transitivity Preserving Graph Embedding
Mingdong Ou, Peng Cui, Jian Pei et al. · 2016 · 1.3K citations
1–5 of 1.4K
2.9K
11
h-index
11
h-index
9
h-index
9
h-index
8
h-index
1–5 of 2.9K
1K

Tel Aviv University
Tel Aviv, Israel
18 h-index
33 publications
1.5K citations

Peking University
Beijing, China
17 h-index
44 publications
3.1K citations
Carnegie Mellon University
Pittsburgh, United States
17 h-index
34 publications
2.9K citations

University of Waterloo
Waterloo, Canada
17 h-index
22 publications
1.4K citations
Stanford University
Stanford, United States
16 h-index
27 publications
2.7K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
33 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
16 h-index
29 publications
1.4K citations
University of Illinois Urbana-Champaign
Urbana, United States
15 h-index
38 publications
4.1K citations
1–8 of 1K
36 publications · 12.4K citations
30
h-index
33 publications · 956 citations
20
h-index
Repository · 42 publications · 1.4K citations
20
h-index
26 publications · 2.2K citations
19
h-index
27 publications · 1K citations
18
h-index
1–5