Introductory Graph Theory and simple algorithms: Difference between revisions
From Santa Fe Institute Events Wiki
(Page for tutorial on graph theory) |
(Page for tutorial on graph theory) |
||
| Line 3: | Line 3: | ||
suggested topics: | suggested topics: | ||
- Small definitions | - Small definitions | ||
- Representations of graphs | - Representations of graphs | ||
- some kinds of useful graphs | - some kinds of useful graphs | ||
- where are graphs useful? | - where are graphs useful? | ||
- Trees | - Trees | ||
- certain simple theorems about graphs and trees | - certain simple theorems about graphs and trees | ||
- Algorithmic notation ( Big O, theta, Omega) | - Algorithmic notation ( Big O, theta, Omega) | ||
- shortest path algorithms, minimum spanning trees, phylogenetic trees -> (open to suggestion, and as time and interest permits). | - shortest path algorithms, minimum spanning trees, phylogenetic trees -> (open to suggestion, and as time and interest permits). | ||
Latest revision as of 03:32, 19 June 2007
Friday, June 22, 2- 3:15 pm by Amitabh_Trehan
suggested topics:
- Small definitions
- Representations of graphs
- some kinds of useful graphs
- where are graphs useful?
- Trees
- certain simple theorems about graphs and trees
- Algorithmic notation ( Big O, theta, Omega)
- shortest path algorithms, minimum spanning trees, phylogenetic trees -> (open to suggestion, and as time and interest permits).