everything.study
COMP 5900

Special Topics in Computer Science

0.5 credit · Graduate

Special topics not covered by other graduate courses. Details will be available from the School at the time of registration.

2026

Topics

  • Graph definitions and representations: basic terminology, adjacency lists and
  • Graph traversal, connectivity, and spanning trees: BFS, DFS, connected
  • Network flows and minimum cuts: Ford–Fulkerson, augmenting paths
  • Advanced matching algorithms: Hopcroft–Karp, overview of Edmonds’
  • Graph coloring and planar graphs: vertex coloring, greedy methods, complexity
  • Planar separators and Schnyder woods: separator theorems, balanced
  • Geometric graphs: unit disk and intersection graphs, Delaunay triangulations
  • Geometric and spectral graph theory: Theta and Yao graphs; adjacency and
  • Random graphs: classical models, connectivity thresholds, and probabilistic
  • Tree-decompositions and treewidth: bags, adhesion, width, treewidth
  • Structure of tree-decompositions: equivalent characterizations, separators
  • Algorithms on bounded-treewidth graphs: dynamic programming for Vertex

Readings

  • J. Kleinberg and E. Tardos, Algorithm Design.
  • R. Diestel, Graph Theory, 6th edition, Springer.
  • A. Brandstädt, V. B. Le, and J. P. Spinrad, Graph Classes: A Survey, SIAM, 1999.
  • M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 2nd edition, 2004.
  • H. L. Bodlaender and A. M. C. A. Koster, Combinatorial Optimization on Graphs of Bounded Treewidth.
2021

Readings

  • Erik Dahlman, Stefan Parkvall, Johan Skold, 5G NR: The Next Generation Wireless Access Technology, Academic Press, 2018.
  • Saad Z. Asif, 5G Mobile Communications - Concepts and Technologies, Taylor & Francis Group LLC - CRC Press, 2019.
  • Both textbooks are available through the Carleton University Library.
Sources