MA010 Graph Theory (an online guide)
-
MA010 Graph Theory (an online guide)
-
Nyní studovatCourse organization
-
Nyní studovatBonus Assignments
-
•How "deep" is this graph 4. 12. 2013
-
•Full edge colouring of bipartite graphs 4. 12. 2013
-
Stationary Cops Catching a Robber in a Graph 28. 11. 2012
-
One (mobile) Cop Catching a Robber in a Graph 28. 11. 2012
-
Labeled Neighbourhoods in Planar Graphs 5. 12. 2013
-
-
Nyní studovatComing BIG change in this course
-
Nyní studovatLecture 1: What is a graph
-
Nyní studovatCommon Topics and Applications of Graphs
-
Nyní studovatLecture 2: Connectivity in Graphs
-
Nyní studovatLecture 3: Graph distance
-
Nyní studovatLecture 4: Network flows
-
Nyní studovatLecture 5: Basics of trees
-
Nyní studovatOther Interesting Areas of Graphs
-
Nyní studovatLecture 6: MST and greedy algorithms
-
Nyní studovatLecture 7: Colourings, and other hard problems
-
Nyní studovatLecture 8: Planarity and drawings of graphs
-
Nyní studovatSome Advanced Lectures 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
-
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í studovatBonus Assignments
-
•How "deep" is this graph 4. 12. 2013
-
•Full edge colouring of bipartite graphs 4. 12. 2013
-
Stationary Cops Catching a Robber in a Graph 28. 11. 2012
-
One (mobile) Cop Catching a Robber in a Graph 28. 11. 2012
-
Labeled Neighbourhoods in Planar Graphs 5. 12. 2013
-
-
Nyní studovatComing BIG change in this course
-
Nyní studovatLecture 1: What is a graph
-
Nyní studovatCommon Topics and Applications of Graphs
-
Nyní studovatLecture 2: Connectivity in Graphs
-
Nyní studovatLecture 3: Graph distance
-
Nyní studovatLecture 4: Network flows
-
Nyní studovatLecture 5: Basics of trees
-
Nyní studovatOther Interesting Areas of Graphs
-
Nyní studovatLecture 6: MST and greedy algorithms
-
Nyní studovatLecture 7: Colourings, and other hard problems
-
Nyní studovatLecture 8: Planarity and drawings of graphs
-
Nyní studovatSome Advanced Lectures 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
-