MA010 Graph Theory (an online guide)
-
MA010 Graph Theory (an online guide)
-
Nyní studovatCourse organization
-
Nyní studovatBonus Assignments
-
Nyní studovatComing BIG change in this course
-
Nyní studovatBasic Topics and Applications of Graphs
-
Nyní studovatLecture 1: What is a GRAPH
-
Nyní studovatLecture 2: Connectivity and Spanning Trees
-
Nyní studovatLecture 3: Graph Distance and Path Finding
-
Nyní studovatLecture 4: Graph Cuts and Network Flows
-
Nyní studovatMore Graph Theory
-
Nyní studovatLecture 5: Matching, Covers and Packing
-
Nyní studovatLecture 6: Colouring Graphs
-
Interactive demonstrations (need java)
-
-
Nyní studovatLecture 7: Drawings and Planar Graphs
-
Nyní studovatLecture 8: On Difficulty of Graph Problems
-
Nyní studovatLecture X5: Basics of trees
-
Nyní studovatLecture X6: MST and greedy algorithms
-
Nyní studovatSelected Advanced Topics on Graphs *
-
Nyní studovatLecture 9*: Intersection graphs in brief
-
Nyní studovatLecture 10*: Width measures and minors
-
Nyní studovatLecture 11*: Advanced drawings of graphs
-
Nyní studovatLecture 12*: Introduction to Ramsey theory
-
Basic Topics and Applications of Graphs
In this first part of the MA010 course the students will learn many basic graph terms and concepts, with the focus on traditional areas of application of graphs in informatics and computing. Some topics are thus overlapping with the first-year IB000 (and other discrete math) course and with subsequent bachelor courses on algorithms. This course, though, puts more stress on the mathematical side of the presented algorithmic applications and on understanding of why the applications work. Some less-known and more advanced extensions are briefly surveyed, too.
-
MA010 Graph Theory (an online guide)
-
Nyní studovatCourse organization
-
Nyní studovatBonus Assignments
-
Nyní studovatComing BIG change in this course
-
Nyní studovatBasic Topics and Applications of Graphs
-
Nyní studovatLecture 1: What is a GRAPH
-
Nyní studovatLecture 2: Connectivity and Spanning Trees
-
Nyní studovatLecture 3: Graph Distance and Path Finding
-
Nyní studovatLecture 4: Graph Cuts and Network Flows
-
Nyní studovatMore Graph Theory
-
Nyní studovatLecture 5: Matching, Covers and Packing
-
Nyní studovatLecture 6: Colouring Graphs
-
Interactive demonstrations (need java)
-
-
Nyní studovatLecture 7: Drawings and Planar Graphs
-
Nyní studovatLecture 8: On Difficulty of Graph Problems
-
Nyní studovatLecture X5: Basics of trees
-
Nyní studovatLecture X6: MST and greedy algorithms
-
Nyní studovatSelected Advanced Topics on Graphs *
-
Nyní studovatLecture 9*: Intersection graphs in brief
-
Nyní studovatLecture 10*: Width measures and minors
-
Nyní studovatLecture 11*: Advanced drawings of graphs
-
Nyní studovatLecture 12*: Introduction to Ramsey theory
-