Graph algorithms for spanning structures encompass a family of techniques designed to extract sparse subgraphs that preserve essential connectivity and distance properties of the original network.

Graph processes and random structures form a vibrant subfield of graph theory concerned with the probabilistic evolution of networks and the emergence of complex connectivity patterns. At its core ...

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 ...