PACE challenge

Why?

graph

Who?

Students and researchers at any level 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 the implementation to the PACE challenge. Your implementation will then compete with implementations written by other teams around the world.

Learn more about

How?