An exact algorithm for the maximum leaf spanning tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 161-172

  Fernau, Henning ^a   Kneis, Joachim ^b   Kratsch, Dieter ^c   Langer, Alexander ^b   Liedloff, Mathieu ^d   Raible, Daniel ^a   Rossmanith, Peter ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITÉ DE LORRAINE   (France)

^d UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED DOMINATING SET; EXACT ALGORITHMS; EXPONENTIAL TIME; LOWER BOUNDS; PARAMETERIZED; RUNNING TIME; SPANNING TREE; SPANNING TREE PROBLEMS; TIME ALGORITHMS; UNDIRECTED GRAPH; WORST CASE;

CONTROL THEORY; GRAPH THEORY;

ALGORITHMS;

EID: 72249114980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_13     Document Type: Conference Paper

References (19)

1. Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms 14(1), 1-23 (1993)
2. Bonsma, P.: Sparse cuts, matching-cuts and leafy trees in graphs. PhD thesis, University of Twente, the Netherlands (2006)
3. Bonsma, P.S., Brueggemann, T., Woeginger, G.J.: A faster FPT algorithm for finding spanning trees with many leaves. In: Rovan, B., Vojtáš , P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 259-268. Springer, Heidelberg (2003)
4. Bonsma, P.S., Zickfeld, F.: Spanning trees with many leaves in graphs without diamonds and blossoms. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 531-543. Springer, Heidelberg (2008)
5. Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 15(10), 908-920 (2004)
6. Daligault, J., Gutin, G., Kim, E.J., Yeo, A.: FPT Algorithms and Kernels for the Directed k-Leaf Problem. CoRR abs/0810.4946 (2008);
7. also: J. Comput. System Sci. (2009), doi:10.1016/j.jcss.2009.06.005
8. Downey, R.G., Fellows, M.R.: Parameterized computational feasibility. In: Feasible Mathematics II, pp. 219-244. Birkhäuser, Boston (1995)
9. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is Ptime extremal structure I. In: Proc. of 1st ACiD, pp. 1-41. College Publications (2005)
10. Fellows, M.R., McCartin, C., Rosamond, F.A., Stege, U.: Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 240-251. Springer, Heidelberg (2000)
11. n. Algorithmica 52(2), 153-166 (2008)
12. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5) (2009)
13. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
14. Kneis, J., Langer, A., Rossmanith, P.: A new algorithm for finding trees with many leaves. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 270-281. Springer, Heidelberg (2008)
15. Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proc. of 3rd MOBIHOC, pp. 112-122 (2002)
16. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)
17. Park, M.A., Willson, J., Wang, C., Thai, M., Wu, W., Farago, A.: A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. In: Proc. of 8th MOBIHOC, pp. 22-31. ACM, New York (2007)
18. Raman, V., Saurabh, S., Sikdar, S.: Improved exact exponential algorithms for vertex bipartization and other problems. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 375-389. Springer, Heidelberg (2005)
19. Thai, M., Wang, F., Liu, D., Zhu, S., Du. Connected, D.Z.: dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mobil. Comp. 6(7), 721-730 (2007)