MA010 Graph Theory (an online guide)
-
MA010 Graph Theory (an online guide)
-
Study nowCourse organization
-
Study nowLecture 1: What is a graph
-
Study nowLecture 2: Graph connectivity and searching
-
Study nowLecture 3: Graph distance
-
Study nowLecture 4: Basics of trees
-
Study nowLecture 5: Trees and greedy algorithms
-
Study nowLecture 6: Network flows
-
Study nowLecture 7: Colourings, and other hard problems
-
Study nowLecture 8: Planarity and drawings of graphs
-
Study nowAbout advanced lectures *
-
Study nowLecture 9*: Intersection graphs in brief
-
Study nowLecture 10*: Width measures and minors
-
Study nowLecture 11*: Advanced drawings of graphs
-
Study nowLecture 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)
-
Study nowCourse organization
-
Study nowLecture 1: What is a graph
-
Study nowLecture 2: Graph connectivity and searching
-
Study nowLecture 3: Graph distance
-
Study nowLecture 4: Basics of trees
-
Study nowLecture 5: Trees and greedy algorithms
-
Study nowLecture 6: Network flows
-
Study nowLecture 7: Colourings, and other hard problems
-
Study nowLecture 8: Planarity and drawings of graphs
-
Study nowAbout advanced lectures *
-
Study nowLecture 9*: Intersection graphs in brief
-
Study nowLecture 10*: Width measures and minors
-
Study nowLecture 11*: Advanced drawings of graphs
-
Study nowLecture 12*: Introduction to Ramsey theory
-