Clemson Discrete Algorithms Group

This is an informal group interested in discrete algorithms. These are algorithms designed for objects such as graphs, sequences, or other discrete objects. The group also does research in discrete mathematics in general especially graph theory.


Participants

Wayne Goddard
Sandee Hedetniemi
Steve Hedetniemi
David Jacobs
Renu Laskar
Pradip Srimani