MA010 Graph Theory (an online guide)
-
MA010 Graph Theory (an online guide)
-
Nyní studovatCourse organization
-
Nyní studovatLecture 1: What is a graph
-
Nyní studovatLecture 2: Graph connectivity and searching
-
Nyní studovatLecture 3: Graph distance
-
Nyní studovatLecture 4: Basics of trees
-
Nyní studovatLecture 5: Trees and greedy algorithms
-
Nyní studovatLecture 6: Network flows
-
Nyní studovatLecture 7: Colourings, and other hard problems
-
Nyní studovatLecture 8: Planarity and drawings of graphs
-
Nyní studovatAbout advanced lectures *
-
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
-
Interactive demonstrations (need java)
Minimum Spanning Tree, the greedy algorithm of Kruskal
The applet web page, by Papagelis Athanasios.
Minimum Spanning Tree, the algorithm originally by Jarník (1930's!)
The applet web page, by Papagelis Athanasios.
-
MA010 Graph Theory (an online guide)
-
Nyní studovatCourse organization
-
Nyní studovatLecture 1: What is a graph
-
Nyní studovatLecture 2: Graph connectivity and searching
-
Nyní studovatLecture 3: Graph distance
-
Nyní studovatLecture 4: Basics of trees
-
Nyní studovatLecture 5: Trees and greedy algorithms
-
Nyní studovatLecture 6: Network flows
-
Nyní studovatLecture 7: Colourings, and other hard problems
-
Nyní studovatLecture 8: Planarity and drawings of graphs
-
Nyní studovatAbout advanced lectures *
-
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
-