MA010 Graph Theory (an online guide)

Interactive demonstrations (need java)

The applet web page, by Papagelis Athanasios.

Dijkstra's Shortest Path Algorithm

The applet home page (copyright Carla Laffra)

Předchozí

Následující

MA010 Graph Theory (an online guide)
- Nyní studovat
  
  Course organization
- Nyní studovat
  
  Bonus Assignments
  - How "deep" is this graph 6. 12. 2012
  - Stationary Cops Catching a Robber in a Graph 30. 11. 2011
  - One (mobile) Cop Catching a Robber in a Graph 30. 11. 2011
  - Labeled Neighbourhoods in Planar Graphs 6. 12. 2012
- Nyní studovat
  
  Lecture 1: What is a graph
  - Interactive demonstrations (need java)
- Nyní studovat
  
  Common Topics and Applications of Graphs
- Nyní studovat
  
  Lecture 2: Connectivity in Graphs
  - Interactive demonstrations (need java)
- Nyní studovat
  
  Lecture 3: Graph distance
  - Interactive demonstrations (need java)
- Nyní studovat
  
  Lecture 4: Network flows
  - Interactive demonstrations (need java)
- Nyní studovat
  
  Lecture 5: Basics of trees
- Nyní studovat
  
  Other Interesting Areas of Graphs
- Nyní studovat
  
  Lecture 6: MST and greedy algorithms
  - Interactive demonstrations (need java)
- Nyní studovat
  
  Lecture 7: Colourings, and other hard problems
  - Interactive demonstrations (need java)
- Nyní studovat
  
  Lecture 8: Planarity and drawings of graphs
  - Interactive demonstrations (need java and flash)
- Nyní studovat
  
  Some Advanced Lectures on Graphs *
- Nyní studovat
  
  Lecture 9*: Intersection graphs in brief
  - Picture demonstration of intersection graphs
- Nyní studovat
  
  Lecture 10*: Width measures and minors
- Nyní studovat
  
  Lecture 11*: Advanced drawings of graphs
- Nyní studovat
  
  Lecture 12*: Introduction to Ramsey theory

Operace

Prohlédnout vše

Interaktivní osnova

Interactive demonstrations (need java)

Operace