We're still working on our article for Topological Sort. Please check back soon for more information.
kocr1d|
Find a path to becoming a Topological Sort. Learn more at:
OpenCourser.com/topic/kocr1d/topological
Reading list
We've selected 11 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
Topological Sort.
Provides a comprehensive overview of topological sorting, including both theoretical and practical aspects. It is written by an expert in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of algorithms, including a section on topological sorting. It is written by four authors who are all experts in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of graph algorithms, including a section on topological sorting. It is written by an expert in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of graphs and algorithms, including a section on topological sorting. It is written by an expert in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of graph theory, including a section on topological sorting. It is written by an expert in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of algorithms and data structures, including a section on topological sorting. It is written by an expert in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of algorithms, including a section on topological sorting. It is written by two authors who are both experts in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of graph theory, including a section on topological sorting. It is written by two authors who are both experts in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of data structures and algorithms, including a section on topological sorting. It is written by three authors who are all experts in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of combinatorial optimization, including a section on topological sorting. It is written by two authors who are both experts in the field, and it is suitable for both undergraduate and graduate students.
Provides a comprehensive overview of computational complexity, including a section on topological sorting. It is written by two authors who are both experts in the field, and it is suitable for both undergraduate and graduate students.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/kocr1d/topological
Save
