# Edge Minimizing the Student Conflict Graph

arXiv: https://arxiv.org/abs/2102.06743 · HTML: https://mlsanity.com/paper/2102.06743/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 8 references that are in the map.
- First posted on arXiv 12 Feb 2021.

## Abstract (arXiv)

In many schools, courses are given in sections. Prior to timetabling students need to be assigned to individual sections. We give a hybrid approximation sectioning algorithm that minimizes the number of edges (potential conflicts) in the student conflict graph (SCG). We start with a greedy algorithm to obtain a starting solution and then continue with a constraint programming based algorithm (CP-SAT) that reduces the number of edges. We apply the sectioning algorithm to a highly constrained timetabling model which we specify.