Live briefing
Everything about Directed graph
Graph with oriented edges
In mathematics, and more specifically in graph theory, a directed graph is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Directed graphA 5-minute orientation
- Skim a recent paper: A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and DirectionsInfluential work since 2022
- Pick up a classic book: Graphs & digraphsThe most-reprinted book on the subject
- Read the landmark paper: Graph drawing by force‐directed placementCited 4,525 times
- Go sideways: Graph (discrete mathematics)A closely related topic
- Go sideways: Directed acyclic graphA closely related topic
📖 Definitions
Noun A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
🏆 Landmark papers (most cited)
Graph drawing by force‐directed placement
Algorithm 457: finding all cliques of an undirected graph
Hausdorff dimension in graph directed constructions
Packing rooted directed cuts in a weighted directed graph
Kernels of Directed Graph Laplacians
A directed acyclic graph for interactions
Normalized graph Laplacians for directed graphs
Adversarial Directed Graph Embedding
🆕 Influential since 2022
A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions
A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions
Tutorial on directed acyclic graphs
Provably Powerful Graph Neural Networks for Directed Multigraphs
Directed Graph Auto-Encoders
📚 Books worth reading
Graphs & digraphsGary Chartrand, L. Lesniak · 1986
DigraphsJørgen Bang-Jensen, Jorgen Bang-Jensen · 2001- 📕Graphs & digraphsMehdi Behzad · 1979
Multivariable ControlK. J. Reinschke · 1988
The Schorr-Waite marking algorithm revisitedNachum Dershowitz · 1979
Compartmental modeling with networksGilbert G. Walter · 1998
The classification of countable homogeneous directed graphs and countable homogeneous n-tournamentsGregory L. Cherlin · 1998
The Design of an extendible graph editorFrances Newbery Paulisch · 1993
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Graph (discrete mathematics) In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some…
- Directed acyclic graph In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Connectivity (graph theory) In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges)…
- Graph (abstract data type) In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph…
- Multigraph In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called parallel edges),…
- Transitive reduction In the mathematical field of graph theory, a transitive reduction of a directed graph D is another directed graph with the same vertices and as few edges…
- Incidence matrix In mathematics, an incidence matrix is a logical matrix that shows the relationship between two classes of objects, usually called an incidence relation…