-
Institution:
-
Clemson University
-
Subject:
-
Computer Science
-
Description:
-
Study of selected topics in advanced algorithms drawn from graph algorithms (network flows, matchings, cuts, planarity testing), approximation algorithms (traveling salesman, linear relaxation techniques), distributed algorithms (mutual exclusion, synchronization, self-stabilization), parallel algorithms (parallel prefix, models, sorting), or randomized algorithms (sampling, probabilistic methods, random walks). May be repeated for a maximum of nine credits, but only if different topics are covered. Preq: CPSC 8400.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(864) 656-4636
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.