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 algebras form a broad class of operator and algebraic structures arising from directed graphs, bridging the worlds of ring theory, operator algebras and dynamical systems. At their core, these ...

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