Combinatorics and discrete mathematics constitute the study of finite or countable structures and the algorithms that govern them. At its heart is enumeration: the art of counting arrangements, ...

Graph algorithms lie at the heart of modern computational theory, probing how networks of vertices and edges can be explored, optimised or transformed under constraints that often defy efficient ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

Algebra is the discipline of pure mathematics that is concerned with the study of the abstract properties of a set, once this is endowed with one or more operations that respect certain rules (axioms) ...