Advertisement

Minimum Leaf Out-Branching Problems

  • Gregory Gutin
  • Igor Razgon
  • Eun Jung Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5034)

Abstract

Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We prove that MinLOB is polynomial-time solvable for acyclic digraphs. In general, MinLOB is NP-hard and we consider three parameterizations of MinLOB. We prove that two of them are NP-complete for every value of the parameter, but the third one is fixed-parameter tractable (FPT). The FPT parametrization is as follows: given a digraph D of order n and a positive integral parameter k, check whether D contains an out-branching with at most n − k leaves (and find such an out-branching if it exists). We find a problem kernel of order O(k·2 k ) and construct an algorithm of running time O(2 O(klogk) + n 3), which is an ‘additive’ FPT algorithm.

Keywords

Bipartite Graph Vertex Cover Tree Decomposition Acyclic Digraph Problem Kernel 
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.
    Alon, N., Fomin, F., Gutin, G., Krivelevich, M., Saurabh, S.: Parameterized Algorithms for Directed Maximum Leaf Problems. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 352–362. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Alon, N., Fomin, F., Gutin, G., Krivelevich, M., Saurabh, S.: Better Algorithms and Bounds for Directed Maximum Leaf Problems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Spanning directed trees with many leaves. Report arXiv: 0803.0701 (2008)Google Scholar
  4. 4.
    Alt, H., Blum, N., Melhorn, K., Paul, M.: Computing of maximum cardinality matching in a bipartite graph in time \(O(n^{1.5}\sqrt{m/\log n})\). Inf. Proc. Letters 37, 237–240 (1991)zbMATHCrossRefGoogle Scholar
  5. 5.
    Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2000), www.cs.rhul.ac.uk/books/dbook/ Google Scholar
  6. 6.
    Bang-Jensen, J., Yeo, A.: The minimum spanning strong subdigraph problem is fixed parameter tractable. Discrete Applied Math. (to appear)Google Scholar
  7. 7.
    Bonsma, P.S., Dorn, F.: An FPT Algorithm for Directed Spanning k-Leaf. Preprint 046-2007, Combinatorial Optimization & Graph Algorithms Group, TU Berlin (November 2007) (preprint 046-2007)Google Scholar
  8. 8.
    Chandran, L.S., Grandoni, F.: Refined memorization for vertex cover. Inform. Proc. Letters 93, 125–131 (2005)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  10. 10.
    Demers, A., Downing, A.: Minimum leaf spanning tree. US Patent no. 6,105,018 (August 2000)Google Scholar
  11. 11.
    Fernau, H.: Parameterized Algorithmics: A Graph-theoretic Approach. Habilitation thesis, U. Tübingen (2005)Google Scholar
  12. 12.
    Fernau, H.: Parameterized Algorithmics for Linear Arrangement Problems(manscript, July 2005)Google Scholar
  13. 13.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
  14. 14.
    Guo, J., Niedermeier, R.: Invitation to Data Reduction and Problem Kernelization. ACM SIGACT News 38, 31–45 (2007)CrossRefGoogle Scholar
  15. 15.
    Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory of Computing Systems 41, 521–538 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Gutin, G., Szeider, S., Yeo, A.: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica (to appear)Google Scholar
  17. 17.
    Heggernes, P., Paul, C., Telle, J.A., Villanger, Y.: Interval completion with few edges. In: Proc. STOC 2007 - 39th ACM Symposium on Theory of Computing, pp. 374–381 (2007)Google Scholar
  18. 18.
    Kapoor, S., Ramesh, H.: An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27, 120–130 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Las Vergnas, M.: Sur les arborescences dans un graphe orienté. Discrete Math. 15, 27–29 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31, 335–354 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Gregory Gutin
    • 1
  • Igor Razgon
    • 2
  • Eun Jung Kim
    • 1
  1. 1.Department of Computer Science Royal HollowayUniversity of London, Egham, SurreyUK
  2. 2.Department of Computer ScienceUniversity College CorkIreland

Personalised recommendations