We're still working on our article for Directed Acyclic Graphs. Please check back soon for more information.
s2jo0v|
Find a path to becoming a Directed Acyclic Graphs. Learn more at:
OpenCourser.com/topic/s2jo0v/directed
Reading list
We've selected 14 books
that we think will supplement your
learning. Use these to
develop background knowledge, enrich your coursework, and gain a
deeper understanding of the topics covered in
Directed Acyclic Graphs.
Focuses specifically on directed acyclic graphs, providing a detailed treatment of their algorithms and applications. It covers topics such as topological sorting, transitive closure, and shortest paths.
This textbook provides a comprehensive overview of graph theory in German. It includes chapters on directed acyclic graphs and their applications in computer science and operations research.
This textbook provides a comprehensive overview of graph theory, covering topics such as directed acyclic graphs, graph algorithms, and network analysis. It is suitable for students and researchers in computer science and related fields.
Covers a wide range of graph algorithms, including algorithms for finding shortest paths, maximum flows, and minimum spanning trees. It also includes a section on DAGs, which discusses algorithms for topological sorting and finding strongly connected components.
Provides a comprehensive overview of graph algorithms, including algorithms for finding shortest paths, maximum flows, and minimum spanning trees. It also includes a section on DAGs, which discusses algorithms for topological sorting and finding strongly connected components.
This textbook covers a wide range of algorithms, including chapters on directed acyclic graphs and topological sorting. It is suitable for undergraduate and graduate students in computer science.
This classic textbook covers a wide range of algorithms, including chapters on directed acyclic graphs and topological sorting. It is suitable for undergraduate and graduate students in computer science.
Provides a comprehensive overview of graph theory, including a section on DAGs. The authors, both experts in the field, cover a wide range of topics, from the basics of graph theory to advanced concepts such as graph coloring and graph isomorphism.
Provides a more accessible introduction to algorithms, including chapters on directed acyclic graphs and topological sorting. It is suitable for undergraduate students and self-learners.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/s2jo0v/directed
Save
