An FPT algorithm for cycle rank on semi-complete digraphs
Lett′t^{\prime}be the unique child oftt. For eachS⊆[k]S\subseteq[k], we define itsrelabeled setρa→b(S)\rho_{a\to b}(S)as(S∖{a})∪{b}(S\setminus\{a\})\cup\{b\}ifa∈Sa\in S, andρa→b(S)=S\rho_{a\to b}(S)=Sotherwise. We iterate over each recordM′∈ℛt′M^{\prime}\in\mathcal{R}_{t^{\prime}}. Since relabeling does not add new edges, th...
