Graph Theory and Applications
Computer Science
In this course, we discuss graphs. We cover the foundations of graph theory and also discuss techniques for graph analysis. In particular, we address the following topics:
- Computational Graph Representations
- Isomorphism
- Transitive Closure
- Warshall’s Algorithm
- Planarity
- Euler’s Theorem
- Shortest Path Problem
- Dijkstra’s Algorithm
- Breadth- and Depth-First Search Algorithms
- Trees
- Huffman Compression
- Cycle Detection
- Strongly Connected Components
- Minimum Spanning Trees
- Prim and Kruskal Algorithms
- Complex Networks
- Regular, Random, Small-world, and Scale-free Networks
- Centrality Analysis
- Clustering Coefficient