References for Directed acyclic graph

Back to article

References to other articles, organized by section

Computer science
Cycle graph
Directed graph
Edge (graph theory)
Graph theory
Mathematics
Topological ordering
Vertex (graph theory)

Definitions

Directed graph
Edge (graph theory)
Graph (discrete mathematics)
Path (graph theory)
Reachability
Vertex (graph theory)

Reachability relation, transitive closure, and transitive reduction

Covering relation
Graph drawing
Hasse diagram
Partial order
Reachability
Transitive closure
Transitive reduction

Topological ordering

Edge (graph theory)
Linear extension
Topological ordering
Topological sorting

Combinatorial enumeration

Adjacency matrix
Bijective proof
Eigenvalue
Eric W. Weisstein
Graph enumeration
Identity matrix
Logical matrix
Loop (graph theory)
On-Line Encyclopedia of Integer Sequences
Real number
Recurrence relation

Related families of graphs

Arborescence (graph theory)
Multitree
Orientation (graph theory)
Polytree
Tree (graph theory)

Topological sorting and recognition

Depth-first search
Linear time
Postorder
Topological sorting

Construction from cyclic graphs

Acyclic orientation
Chromatic polynomial
Condensation (graph theory)
Edge contraction
Empty set
Feedback arc set
Feedback vertex set
NP-hard
Orientation (graph theory)
Strongly connected component
Total order

Transitive closure and transitive reduction

Breadth-first search
Computational complexity of matrix multiplication
Dense graph
Depth-first search

Closure problem

Closure problem
Maximum flow problem

Path algorithms

Bellman–Ford algorithm
Dijkstra's algorithm
Longest path problem
NP-hard
Shortest path
Topological sorting

Scheduling

Circular dependency
Critical path method
Dependency graph
Instruction scheduling
Longest path problem
Makefile
Milestone (project management)
Object file
Program evaluation and review technique
Schedule
Source code
Spreadsheet

Data processing networks

Acyclic dependencies principle
Bit
Combinational logic
Common subexpression elimination
Compiler
Data stream
Dataflow programming
Feedforward neural network
Logic gate
Parallel algorithm

Causal structures

Bayesian network
Causal loop
Causal sets
Causality
Epidemiology
Influence diagram
Moral graph
Path (graph theory)

Genealogy and version history

Algorithm
Computational geometry
Consanguinity
Delaunay triangulation
Distributed revision control
Family tree
Git
Matrilineal
Patrilineal
Pedigree collapse
Point location
Ptolemaic dynasty
Randomization
Randomized algorithm

Citation graphs

Barabási–Albert model
Citation analysis
Citation graph
Citation impact
Derek J. de Solla Price
Judgment (law)
Main path analysis
Network Science
Price's model
Prior art

Data compression

Academic Press
Alison Gopnik
ArXiv (identifier)
Bibcode (identifier)
Binary decision diagram
Brendan McKay (mathematician)
Charles E. Leiserson
CiteSeerX (identifier)
Clifford Stein
Computers and Intractability
Data compression
Data structure
David S. Johnson
David Spiegelhalter
Decision tree
Depth-first search
Deterministic acyclic finite state automaton
Dexter Kozen
Doi (identifier)
Eric W. Weisstein
Frank Harary
Frédérique Oggier
George Furnas
Gordon Royle
Herbert Wilf
Introduction to Algorithms
ISBN (identifier)
János Pach
Journal of Integer Sequences
Journal of the American Society for Information Science
Judea Pearl
Laura Schulz
M. Lothaire
Management Science (journal)
MathWorld
Micha Sharir
Michael Garey
MR (identifier)
Neil Sloane
Nicos Christofides
OCLC (identifier)
Philip Dawid
Ping Zhang (graph theorist)
PMC (identifier)
PMID (identifier)
Richard P. Stanley
Robert Sedgewick (computer scientist)
Ron Rivest
S2CID (identifier)
Science (journal)
Steffen Lauritzen
String (computer science)
Thomas H. Cormen
Trie
Truth assignment
W. H. Freeman and Company

Source on Wikipedia (https://en.wikipedia.org)

--

Gemipedia Home
Go to Article
Using English Wikipedia. Change Language?

--
Size: 11.42 KB. 92.68% smaller than original: 155.98 KB 🤮
Fetched: 23 ms. Converted: 487 ms. 🐇

Made with 📚 and ❤️ by Acidus (mailto://)

All Wikipedia content is licensed under CC BY-SA 3.0