School of Computer Science
Technical Workshop Series: Graph Mining in Python Using NetworkX (Part 3)
Presenter: – PhD Candidate Mahshad Hashemi
Date: Monday, November 27th, 2023 - 3:30 pm – 4:30 pm
Location: 4th Floor (Workshop space) at 300 Ouellette Avenue (School of Computer Science Advanced Computing Hub)
Abstract:
In previous workshops, we covered Graph Theory and some of the common real-life problems that are solved using Graph Theory. Also, we introduced NetworkX and its fundamental functions of it. In this workshop, we will continue with more algorithms and case scenarios. At the end of this workshop, students will be able to use the NetworkX package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.
Workshop Outline:
- Shortest Path
- BFS
- DFS
- Dijkstra
- Bellman-Ford
- Betweenness Centrality
- Closeness Centrality
- Bipartite Sets
Prerequisites:
Basic knowledge of Python and fundamentals of Graph Theory
Biography:
Mahshad is a Ph.D. candidate and research assistant in the School of Computer Science. Her primary research focus is on using Graph Theory to solve biological problems.