Algorithmic Graph Theory
Troy University
CourseCS 6660
Theory and algorithms for solving computational problems in graphs and hypergraphs. The topics may include minimum transversals, maximum matchings, trees and bipartite graphs, chordal graphs, planar graphs and graph coloring, hypertrees, chordal hypergraphs, planar hypergraphs and hypergraph coloring, colorability, perfection, and chromatic spectrum.
- Credits
3 credits
- Course Code
CS 6660