Part 3 · Course

MA461 GRAPH THEORY AND NETWORKS

Mathematical Sciences · 2 versions

Offerings are listed from 2027-1 Fall through 2031-1 Fall.

MA461 GRAPH THEORY AND NETWORKS

  • 3.0 credit hours
  • (BS=0.0, ET=0.0, MA=3.0)
  • Version 2013-1
  • In effect
Scope
This course introduces the student to the techniques, algorithms, and structures used in graph theory and network flows in order to solve real world discrete optimization problems. Basic definitions relating to graphs and digraphs, together with a large number of examples and applications are provided. Cadets learn to implement new graph theory techniques in their area of study. Emphasis is on modeling, algorithms, and optimization.
Lessons
40 @ 55 min (0.000 Att/wk)
Labs
0 @ 0 min
Special requirements
Two special problems.
Prerequisites
one of
MA461 version 2013-1 offerings
Term Sections Section size Capacity Enrolled Wait list Seats Closed Details
2028-1 Fall 1 18 18 9 0 9 No Hours for 2028-1 Fall
2029-8 Fall Exch 1 18 18 0 0 18 No Hours for 2029-8 Fall Exch
2029-9 Spring Exch 1 18 18 0 0 18 No Hours for 2029-9 Spring Exch
2030-1 Fall 1 18 18 0 0 18 No Hours for 2030-1 Fall

MA461 GRAPH THEORY AND NETWORKS

  • 3.0 credit hours
  • (BS=0.0, ET=0.0, MA=0.0)
  • Version 2004-1
  • Archived
Scope
This course introduces the student to the techniques, algorithms, and structures used in graph theory and network flows in order to solve real world discrete optimization problems. Basic definitions relating to graphs and digraphs, together with a large number of examples and applications are provided. Cadets learn to implement new graph theory techniques in their area of study. Emphasis is on modeling, algorithms, and optimization.
Lessons
40 @ 55 min (0.000 Att/wk)
Labs
0 @ 0 min
Special requirements
Two special problems.
Prerequisites
MA206
Back To Top