Skip to main content

Advertisement

Springer Nature Link
Log in

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In the Directed Feedback Arc (Vertex) Set problem, we are given a digraph D with vertex set V(D) and arcs set A(D) and a positive integer k, and the question is whether there is a subset X of arcs (vertices) of size at most k such that the digraph obtained after deleting X from D is an acyclic digraph. In this paper we study these two problems in the realm of parametrized and kernelization complexity. More precisely, for these problems we give polynomial time algorithms, known as kernelization algorithms, on several digraph classes that given an instance (D, k) of the problem returns an equivalent instance \((D',k')\) such that the size of \(D'\) and \(k'\) is at most \(k^{O(1)}\). We extend previous results for Directed Feedback Arc (Vertex) Set on tournaments to much larger and well studied classes of digraphs. Specifically we obtain polynomial kernels for k-FVS on digraphs with bounded independence number, locally semicomplete digraphs and some totally \(\Phi \)-decomposable digraphs, including quasi-transitive digraphs. We also obtain polynomial kernels for k-FAS on some totally \(\Phi \)-decomposable digraphs, including quasi-transitive digraphs. Finally, we design a subexponential algorithm for k-FAS running in time \(2^{O(\sqrt{k} (\log k)^c)}n^d\) for constants c, d. on locally semicomplete digraphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. Round digraphs can be recognized (and a round ordering provided) in polynomial time [6, section 2.10.1], [34].

  2. The complete digraph \(K^*_{2k+2}\) is a locally semicomplete no instance.

  3. That is \(Q \in \Phi \) and \(M_1,\ldots ,M_q\) are totally \(\Phi \)-decomposable modules of D.

  4. In principle \(Z'\) might contain some proper subset of \(V(H_i)\), for \(i=a+1,\ldots ,c\).

  5. This is not necessarily true, if there are 2-cycles.

  6. Note that \(k\log {}k\log \log {}k\le k^2\) as soon as \(k\ge 2\).

References

  1. Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proc. STOC’05: the 37th Annual ACM Symp. on Theory of Computing, pp. 684–693. ACM Press, New York (2005)

  3. Alon, N.: Ranking tournaments. SIAM J. Discrete Math. 20, 137–142 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Proc. 36. ICALP, Lecture Notes in Computer Science 5555, pp. 49–58. Springer, Berlin (2009)

  5. Bang-Jensen, J.: Locally semicomplete digraphs: a generalization of tournaments. J. Graph Theory 14(3), 371–390 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2009)

    Book  MATH  Google Scholar 

  7. Bang-Jensen, J., Huang, J.: Quasi-transitive digraphs. J. Graph Theory 20(2), 141–161 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bang-Jensen, J., Maddaloni, A.: Arc-disjoint paths in decomposable digraphs. J. Graph Theory 77, 89–110 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bang-Jensen, J., Thomassen, C.: A polynomial algorithm for the 2-path problem for semicomplete digraphs. SIAM J. Discrete Math. 5, 366–376 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bessy, S., Fomin, F.V., Gaspers, S., Paul, C., Perez, A., Saurabh, S., Thomassé, S.: Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6), 1071–1078 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Charbit, P., Thomassé, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Comb. Probab. Comput. 16, 1–4 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008)

  14. Chudnovsky, M., Fradkin, A., Seymour, P.: Tournament immersion and cutwidth. J. Comb. Theory Ser. B 102, 93–101 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Conitzer, V.: Computing Slater rankings using similarities among candidates. In: 21st National Conference on Artificial Intelligence (AAAI-06), pp. 613–619 (2006)

  16. Crespelle, C., Paul, C.: Fully-dynamic recognition algorithm and certificate for directed cographs. Discrete Appl. Math. 154(12), 1722–1741 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS, pp. 150–159 (2011)

  18. Dom, M., Guo, J., Hüffner, F., Niedermeier, R., Truß, A.: Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1), 76–86 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Erdős, P., Rado, R.: Intersection theorems for systems of sets. J. Lond. Math. Soc. 35, 85–90 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  20. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151–174 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  21. Feige, U.: Faster FAST(Feedback Arc Set in Tournaments). CoRR, abs/0911.5094 (2009)

  22. Flum, J., Grohe, M.: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, New York (2006)

    Google Scholar 

  23. Fomin, F.V., Pilipczuk, M.: Jungles, bundles and fixed-parameter tractability. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp. 396–413 (2013)

  24. Fomin, F.V., Pilipczuk, M.: Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. In: Proceedings of ESA 2013, Lecture Notes in Computer Science, vol. 8125, pp. 505–516 (2013)

  25. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91–106 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  26. Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  27. Ghouila-Houri, A.: Caractérisation des graphes non orientés dont on peut orienter les arětes de manière à obtenir le graphe d’une relation d’ordre. C. R. Acad. Sci. Paris 254, 1370–1371 (1962)

    MathSciNet  MATH  Google Scholar 

  28. Guo, Y.: Locally semicomplete digraphs. PhD thesis, RWTH Aachen, Germany (1995)

  29. Gutin, G.: Polynomial algorithms for finding Hamiltonian paths and cycles in quasi-transitive digraphs. Australas. J. Comb. 10, 231–236 (1994)

    MathSciNet  MATH  Google Scholar 

  30. Gutin, G., Yeo, A.: Some parameterized problems on digraphs. Comput. J. 51, 363–371 (2008)

    Article  Google Scholar 

  31. Hsiao, S.-Y.: Fixed-parameter complexity of feedback vertex set in bipartite tournaments. ISAAC 7074, 344–353 (2011)

    MathSciNet  MATH  Google Scholar 

  32. Huang, J.: Tournament-like oriented graphs. Ph.D. thesis, School of Computing Science, Simon Fraser University, Canada (1992)

  33. Huang, J.: On the structure of local tournaments. J. Comb. Theory Ser. B 63(2), 200–221 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  34. Huang, J.: Which digraphs are round? Australas. J. Comb. 19, 203–208 (1999)

    MathSciNet  MATH  Google Scholar 

  35. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations (Proc. Symp., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), pp. 85–103. Plenum (1972)

  36. Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament. ISAAC 1(6506), 3–14 (2010)

    MathSciNet  MATH  Google Scholar 

  37. Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. Inf. Process. Lett. 114, 556–560 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  38. Lokshtanov, D., Misra, N., Saurabh, S.: The multivariate algorithmic revolution and beyond. Chapter Kernelization—preprocessing with a guarantee, volume 7370 of Lecture Notes in Computer Science, pp. 129–161 (2012)

  39. Misra, P., Raman, V., Ramanujan, M.S., Saurabh, S.: A polynomial kernel for feedback arc set on bipartite tournaments. Theory Comput. Syst. 53, 609–620 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  40. Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci 351(3), 446–458 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  41. Skrien, D.J.: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs. J. Graph Theory 6(3), 309–316 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  42. Thomassé, S.: A \(4k^2\) kernel for feedback vertex set. ACM Trans. Algorithms 6, 8 (2010). Article 32

  43. Xiao, M., Guo, J.: A quadratic vertex kernel for feedback arc set in bipartite tournaments. MFCS 7464, 825–835 (2012)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Southern Denmark, 5230, Odense, Denmark

    Jørgen Bang-Jensen

  2. TeCIP Institute, Scuola Superiore Sant’Anna, Via Moruzzi 1, 56124, Pisa, Italy

    Alessandro Maddaloni

  3. The Institute of Mathematical Sciences, Chennai, India

    Saket Saurabh

Authors
  1. Jørgen Bang-Jensen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Alessandro Maddaloni
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Saket Saurabh
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jørgen Bang-Jensen.

Additional information

Jørgen Bang-Jensen and Alessandro Maddaloni: Research supported by the Danish Research Council under Grant Number 1323-00178B.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bang-Jensen, J., Maddaloni, A. & Saurabh, S. Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. Algorithmica 76, 320–343 (2016). https://doi.org/10.1007/s00453-015-0038-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-015-0038-2

Keywords