Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

Graph-theoretic problems of identifying maximum cliques and maximum independent sets occupy a central place in combinatorial optimisation and theoretical computer science. A clique is a set of ...

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.