F2.D – Hitting long directed cycles is fixed-parameter tractable

Saarland Informatics Campus · 140 views · 2020 · 18:42

Open on YouTube

Computability & complexity theoryother

Why the open web links it

Proves that hitting long directed cycles is fixed-parameter tractable in parameterized complexity theory.

Linked by 2 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including mpg.de, mpi-sws.org.