CISC *7210X Graph and Network Algorithms
37½ hours, plus conference and independent work; 3 credits
Data structures to represent graphs. Graph traversal algorithms. MST. Shortest Paths. Network flow. Algorithms for constructing minimum spanning trees, shortest paths, maximum flows, and Euler and Hamilton paths. Vertex and edge coloring algorithms. Computationally hard problems, NP-completeness, and approximation algorithms.
Prerequisite: Computer and Information Science 7200X [714X] or an undergraduate course in analysis of algorithms.
The City University reserves the right, because of changing conditions,
to make modifications of any nature in academic programs and requirements
of the university and its constituent colleges without advanced notice.
Students are advised to consult regularly with college and department counselors
concerning their programs of study.
Access the college's current and recent course bulletins.