-
Institution:
-
University of Pennsylvania
-
Subject:
-
-
Description:
-
Staff. Deals mainly with algorithmic and computational aspects of graph theory. Topics and problems include reachability and connectivity, setcovering, graph coloring, location of centers, location of medians, trees, shortest path, circuits, traveling salesman problem, network flows, matching, transportation, and assignment problems.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(215) 898-5000
-
Regional Accreditation:
-
Middle States Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.