CS 668Graphs, Algorithms, and Applications
Ball State University · 3 credits

Catalog
Concepts of graph theory. Algorithms for graph traversal, shortest paths, connectivity, spanning trees, and matchings. Applications of graphs to computer programming, software engineering, VLSI design, networks and flows, bioinformatics, and parallel programming. Prerequisites: Minimum grade of C or better in CS 601 or CS 617, and CS 602, or permission of the graduate program director
Recent sections
Spring 2027 · 1 section
Jan 11 – Apr 30
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| C01Class #48282 | Time not published | Online ONLINE | Jay S. Bagga |