Skip to main content

Advertisement

Springer Nature Link
Log in

Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper, we employ the multilinear detection technique, combined with proper colorings of graphs, to develop algorithms for two problems in bounded degree graphs. We focus mostly on the k-Internal Out-Branching (k-IOB) problem, which asks if a given directed graph has an out-branching (i.e., a spanning tree with exactly one node of in-degree 0) with at least k internal nodes. The second problem, k-Tree, asks if a given undirected graph G has a (not necessarily induced) copy of a given tree T. That is, k-Tree asks whether T is a subgraph of G. We present an \(O^*(4^k)\) time randomized algorithm for k-IOB, which improves the \(O^*\) running time of the previous best known algorithm for this problem. Then, for directed graphs whose underlying (simple, undirected) graphs have bounded degree \(\varDelta \), we modify our algorithm to solve k-IOB in time \(O^*(2^{(2-\frac{\varDelta +1}{\varDelta (\varDelta -1)})k})\). For k- Tree in graphs of bounded degree 3, we obtain an \(O^*(1.914^k)\) time randomized algorithm. In particular, all of our algorithms use polynomial space.

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. Formal definitions of concepts mentioned in the introduction are given in Sect. 2.

  2. \(O^*\) hides factors polynomial in the input size.

  3. Rcent developments related to k-IOB are discussed in Sect. 6.

References

  1. Alon, N., Yuster, R., Zwick, U.: Color coding. J. Assoc. Comput. Mach. 42(4), 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. arXiv:1007.1161 [hep-th]. (2010)

  3. Björklund, A., Kamat, V., Kowalik, L., Zehavi, M.: Spotting trees with few leaves. In: ICALP, pp. 243–255, (2015)

  4. Cohen, N., Fomin, F.V., Gutin, G., Kim, E.J., Saurabh, S., Yeo, A.: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem. J. Comput. Syst. Sci. 76(7), 650–662 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Daligault, J.: Combinatorial techniques for parameterized algorithms and kernels, with applicationsto multicut. PhD thesis, Universite Montpellier II. Montpellier, Herault, France (2011)

  6. Demers, A., Downing, A.: Minimum leaf spanning tree. US Patent no. 6. 105, 018 Aug 2013

  7. Fomin, F.V., Gaspers, S., Saurabh, S., Thomassé, S.: A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1), 1–6 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fomin, F.V., Grandoni, F., Lokshtanov, D., Saurabh, S.: Sharp separation and applications to exact and parameterized algorithms. Algorithmica 63(3), 692–706 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Representative sets of product families. In: ESA, pp. 443–454, (2014)

  10. Fomin, F.V., Lokshtanov, D., Saurabh, S.: Efficient computation of representative sets with applications in parameterized and exact agorithms. In: SODA, pp. 142–151, (2014)

  11. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: STOC, pp. 47–63, (1974)

  12. Gutin, G., Razgon, I., Kim, E.J.: Minimum leaf out-branching and related problems. Theor. Comput. Sci. 410(45), 4571–4579 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Koutis, I.: Faster algebraic algorithms for path and packing problems. In: ICALP, pp. 575–586, (2008)

  14. Koutis, I., Williams, R.: Limits and applications of group algebras for parameterized problems. In: ICALP, pp. 653–664, (2009)

  15. Li, W., Wang, J., Chen, J., Cao, Y.: A \(2k\)-vertex kernel for maximum internal spanning tree. In: WADS, pp. 495–505, (2015)

  16. Nederlof, J.: Fast polynomial-space algorithms using mobius inversion: improving on steiner tree and related problems. In: ICALP, pp. 713–725, (2009)

  17. Niedermeier, R.: Invitation to Fixed-parameter Algorithms. Oxford University Press, Oxford (2006)

    Book  MATH  Google Scholar 

  18. Ozeki, K., Yamashita, T.: Spanning trees: a survey. Graphs Comb. 27(1), 1–26 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Prieto, E., Sloper, C.: Reducing to independent set structure—the case of \(k\)-internal spanning tree. Nord. J. Comput. 12(3), 308–318 (2005)

    MathSciNet  MATH  Google Scholar 

  20. Rédei, L.: Ein kombinatorischer satz. Acta Litt. Szeged 7, 39–43 (1934)

    MATH  Google Scholar 

  21. Raible, D., Fernau, H., Gaspers, D., Liedloff, M.: Exact and parameterized algorithms for max internal spanning tree. Algorithmica 65(1), 95–128 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  22. Salamon, G.: A survey on algorithms for the maximum internal spanning tree and related problems. Electronic Notes Discrete Math. 36, 1209–1216 (2010)

    Article  MATH  Google Scholar 

  23. Shachnai, H., Zehavi, M.: Representative families: a unified tradeoff-based approach. In: ESA, pp. 786–797, (2014)

  24. Skulrattanakulchai, S.: Delta-list vertex coloring in linear time. Inf. Process. Lett. 98(3), 101–106 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  25. Williams, R.: Finding paths of length \(k\) in \({O}^*(2^k)\) time. Inf. Process. Lett. 109(6), 315–318 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  26. Zehavi, M.: Algorithms for \(k\)-internal out-branching. In: IPEC, pp. 361–373, (2013)

  27. Zehavi, M.: Mixing color coding-related techniques. In: ESA, pp. 1037–1049, (2015)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technion IIT, 32000, Haifa, Israel

    Meirav Zehavi

Authors
  1. Meirav Zehavi
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Meirav Zehavi.

Additional information

A preliminary version of this paper appeared in the proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC’13) [26].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zehavi, M. Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs. Algorithmica 78, 319–341 (2017). https://doi.org/10.1007/s00453-016-0166-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-016-0166-3

Keywords