Advertisement

On Making Directed Graphs Transitive

  • Mathias Weller
  • Christian Komusiewicz
  • Rolf Niedermeier
  • Johannes Uhlmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5664)

Abstract

We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions in order to make a given digraph transitive. This problem has recently been identified as important for the detection of hierarchical structure in molecular characteristics of disease. Mixing up Transitivity Editing with the companion problems on undirected graphs, it has been erroneously claimed to be NP-hard. We correct this error by presenting a first proof of NP-hardness, which also extends to the restricted cases where the input digraph is acyclic or has maximum degree four. Moreover, we improve previous fixed-parameter algorithms, now achieving a running time of O(2.57 k  + n 3) for an n-vertex digraph if k arc modifications are sufficient to make it transitive. In particular, providing an O(k 2)-vertex problem kernel, we positively answer an open question from the literature. In case of digraphs with maximum degree d, an O(k ·d)-vertex problem kernel can be shown. We also demonstrate that if the input digraph contains no “diamond structure”, then one can always find an optimal solution that exclusively performs arc deletions. Most of our results (including NP-hardness) can be transferred to the Transitivity Deletion problem, where only arc deletions are allowed.

Keywords

Search Tree Variable Cycle Satisfying Assignment Input Instance Acyclic Digraph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2002)CrossRefzbMATHGoogle Scholar
  2. 2.
    Böcker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. Algorithmica (to appear, 2009)Google Scholar
  3. 3.
    Böcker, S., Briesemeister, S., Klau, G.W.: On optimal comparability editing with applications to molecular diagnostics. BMC Bioinformatics 10(suppl. 1), S61 (2009); Proc. 7th APBCCrossRefGoogle Scholar
  4. 4.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)CrossRefzbMATHGoogle Scholar
  5. 5.
    Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for Cluster Editing. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312–321. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  7. 7.
    Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory Comput. Syst. 38(4), 373–392 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8-10), 718–726 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Gutin, G., Yeo, A.: Some parameterized problems on digraphs. Comput. J. 51(3), 363–371 (2008)CrossRefGoogle Scholar
  10. 10.
    Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. (to appear, 2009)Google Scholar
  11. 11.
    Jacob, J., Jentsch, M., Kostka, D., Bentink, S., Spang, R.: Detecting hierarchical structure in molecular characteristics of disease using transitive approximations of directed graphs. Bioinformatics 24(7), 995–1001 (2008)CrossRefGoogle Scholar
  12. 12.
    Kratochvíl, J., Tuza, Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1), 40–54 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Munro, J.I.: Efficient determination of the transitive closure of a directed graph. Inf. Process. Lett. 1(2), 56–58 (1971)CrossRefzbMATHGoogle Scholar
  14. 14.
    Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)CrossRefzbMATHGoogle Scholar
  15. 15.
    Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized cluster editing problems. Theory Comput. Syst. 44(1), 91–104 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Yang, B., Zheng, S.Q., Lu, E.: Finding two disjoint paths in a network with minsum-minmin objective function. In: Proc. International Conference on Foundations of Computer Science (FCS 2007), pp. 356–361. CSREA Press (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Mathias Weller
    • 1
  • Christian Komusiewicz
    • 1
  • Rolf Niedermeier
    • 1
  • Johannes Uhlmann
    • 1
  1. 1.Institut für InformatikFriedrich-Schiller-Universität JenaJenaGermany

Personalised recommendations