89 citations · 138 across the 17 of their papers we have counts for
1 paper · 2 filters
Andreas Björklund, Thore Husfeldt, Petteri Kaski
Given a directed graph, we show how to efficiently find a shortest (directed, simple) cycle on an even number of vertices. As far as we know, no polynomial-time algorithm was previ…