-
Institution:
-
Miami University-Hamilton
-
Subject:
-
-
Description:
-
Basic structural properties, trees, connectivity, traversability (Eulerian Tours and Hamiltonian Cycles), vertex and edge colorings, cliques, planarity, and directed graphs. Applications to finding algorithms for shortest path problem, minimum weight tree problem, optimal assignment problem, and other scheduling and transportation problems. Prerequisite: MTH 222 or 231 or permission of instructor.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(513) 785-3000
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.