COSC 560

Algorithms/Graph Theory

Duquesne University · UGRD · Fall 2026

1 section

Catalog description

An introductory course covering concepts such as paths, Eulerian circuits, trees, distance, matchings, connectivity, network flows, colorings, planarity, Hamiltonian cycles, and NP-completeness, with focus on both theoretical and algorithmic aspects and emphasis on writing proofs.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 4 hours ago

001

Availability not recently verified

Class #duquesne-COSC560Fall 2026UGRD3 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?