A Graph-Theoretic Approach to Fair and Skill-Diverse Student Group Formation
A graph-theoretic algorithm for fair and skill-diverse student group formation using Laplacian eigenmaps and constrained k-way graph partitioning. Now deployed at 3 European universities.