main
home
general information
contact/directions
research
academics

degree programs courses course evaluations survival guide courses areas of focus program requirements examination requirements handbook academic integrity people
student corner
news & events
news & events
site map
visitors
prospective students
prospective faculty
search

Department of Computer Science

home > academics > graduate > courses

CSCI 325 - Advanced Computing Algorithms

Choi and Staff

Credits: 3

Graph algorithms, strongly connected components, iconncted components, dominators in acyclic graphs, odered trees, network flow, planarity testing, bipartite matching, theory of NP completeness, NP-complete problems. Design and analysis of approximation algorithms for NP-complete problems. Prerequisite CSCI 212. (Spring, odd years)

home | general information | contact/directions | research | academics | people
student corner | news & events | site map | prospective students | prospective faculty


The George Washington University © 2003, The George Washington University
Department of Computer Science
Last Updated: December 19, 2000