CS 8253: Advanced Graph Algorithms

3 Credit Hours
Courses that may be taken concurrently:
CS 8045
This course covers advanced topics and emerging research work in graph algorithms. Topics cover graph embedding, graph clustering, distances in graphs, flows in graphs, graph compression, algorithmic graph-minor theory, and the design and analysis on the time-complexity of graph algorithms for both serial and parallel computing. The course includes a literature search of current advances in graph algorithms and their application in computing, and reading of research papers and presentation of research findings.