Hall-Janko Graph


This course presents the fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their running times. We will discuss a number of topics, including greedy algorithms, divide and conquer algorithms, dynamic programming, network flow algorithms, NP completeness and computational intractability, approximation algorithms, and randomized algorithms.

For further information, please see the course syllabus.

General Information

Class TimeTue, Thu 3:30-4:45pm
LocationCSI 2117
Instructor Dave Mount
Email mount@cs.umd.edu
Office AVW 3373
Office HoursTo be announced. (Or send me email to request a time.)
Teaching Assistant Aditya Acharya
Email acharya@cs.umd.edu
Office AVW 4103
Office HoursTo be announced. (Or send him email to request a time.)


Importance class announcements will be made through Piazza. Once class has started, I'll send invitations to join the system.

  Return to CMSC 451 Home  —  The cool image at top of page is a portion of the Hall-Janko Graph, a strongly-regular graph on 100 vertices, where every vertex has 36 neighbors.

  Web Accessibility