User Tools

Site Tools


Lab Computational Analytics – Minimum Partition into Plane Subgraphs Challenge

We will study the problem of this years CG:SHOP challenge: Minimum Partition into Plane Subgraphs. Participants will study literature on related problems and write code to participate in the challenge.

Interested students should have some experience in programming, ideally in Python or C++. Additionally basic knowledge of graph algorithms and planar graphs as well as integer programming is helpful.

Dates and Organization

If you are interested in joining this lab, write an informal email to Jonas Charfreitag until 10.10.2021.

There will be an introduction meeting in the first week of the semester. Details on this will follow soon.

teaching/ws21/lab-ca.txt · Last modified: 2021/10/08 16:39 by jonas.charfreitag

Page Tools