On making directed graphs transitive

We present a first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to make a given digraph transitive by a minimum number of arc insertions or deletions. Transitivity Editing has applications in the detection of hierarchical structure in molecular characteristics of diseases. We demonstrate that if the input digraph does not contain “diamonds”, then there is an optimal solution that performs only arc deletions. This fact helps us construct a first proof of NP-hardness, which also extends to the restricted cases in which the input digraph is acyclic or has maximum degree three. By providing an O(k2)O(k2)-vertex problem kernel, we answer an open question from the literature. In case of digraphs with maximum degree d  , an O(k⋅d)O(k⋅d)-vertex problem kernel can be shown. Moreover, we improve previous fixed-parameter algorithms, now achieving a running time of O(k2.57+n3)O(2.57k+n3) for an n-vertex digraph if k arc modifications are sufficient to make it transitive. Our hardness as well as algorithmic results transfer to Transitivity Deletion, where only arc deletions are allowed.

► Making a directed graph transitive by deleting a minimum set of arcs is NP-complete.
► An analogous result holds if deleting and inserting arcs is allowed.
► We attain an efficient fixed-parameter algorithm for the parameter solution size k  .
► A problem kernel containing at most k(k+2)k(k+2) vertices can be computed in cubic time.