PACE Challenge: Directed Feedback Vertex Set

Why?

graph

  • Develop your coding skills!
  • Learn about cool algorithms!
  • Write a Bachelor/Master thesis! (Or just do this for fun!)

Who?

Any student or researcher at Goethe University can participate. You are strongly encouraged to work in a group.

What?

PACE is a yearly, international implementation challenge. This year's challenge is to identify and implement an efficient algorithm that finds the smallest Directed Feedback Vertex Set in a given graph.

In Directed Feedback Vertex Set, the input is a directed graph and we are asked to delete as few vertices as possible to make the graph acyclic:

Feedback Vertex Set in an example graph

If you want, you and your team can submit it to the PACE challenge. Your implementation will then compete with implementations written by other teams around the world.

How?

  • Sign up in Moodle.
  • We will have regular meetings and build a small community.
  • The first meeting is in October. (date to be determined)