CS 415G - Graph Theory

Institution:

University of Kentucky

Subject:

Description:

Theory of linear undirected graphs, including definitions and basic concepts, trees, connectivity, traversability, factorization, planarity and matrices. In addition, algorithm for finding spanning trees, testing connectivity, finding Euler trails, finding a maximum matching in a bipartite graph, and testing planarity will be presented at appropriate times. Applications of algorithms to operations research, genetics and other areas. About 55 percent of the course will be on general theory of graphs, 30 percent on algorithms and 15 percent on applications of these algorithms. Prereq: Consent of instructor. (Same as MA 415G.)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.uky.edu

Phone Number:

(859) 257-9000

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.