Research seminar: Applications of Color Coding in Randomised Algorithms

less than 1 minute read

We demonstrate how color coding can be used to obtain algorithms with fixed parameter tractable complexity for NP-hard problems k-CYCLE and k-PATH.

Slides are available here.