All challenges

Find a vertex permutation that maximizes matched edges between two graphs.

Color a graph with as few colors as possible.

Transform a binary graph coloring to a target coloring using simultaneous neighbor-copy steps.

Partition graph vertices into as few clique groups as possible.

Rig and detonate bridges over several days to balance installation, blast, and harvest value.

Partition a graph into balanced parts while minimizing edge cut and communication volume.