Minimum leaf out-branching and related problems

Theoretical Computer Science

Volumn 410, Issue 45, 2009, Pages 4571-4579

  Gutin, Gregory ^a   Razgon, Igor ^b   Kim, Eun Jung ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Acyclic directed graphs; Directed graphs; Fixed parameter tractable; Minimum number of leaves; Out branchings

Indexed keywords

ACYCLIC DIRECTED GRAPHS; DIRECTED GRAPHS; FIXED-PARAMETER TRACTABLE; MINIMUM NUMBER OF LEAVES; OUT-BRANCHINGS;

COMPUTATIONAL COMPLEXITY; PARAMETERIZATION;

GRAPH THEORY;

EID: 70349402268     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.03.036     Document Type: Article

References (19)

1. 1.5 sqrt(m / log n)). Information Processing Letters 37 4 (1991)
2. Bang-Jensen J., and Gutin G. Digraphs: Theory, Algorithms and Applications (2000), Springer-Verlag
3. Bang-Jensen J., and Yeo A. The minimum spanning strong subdigraph problem is fixed parameter tractable. Discrete Applied Mathematics 156 15 (2008) 2924-2929
4. Bodlaender H.L., Downey R.G., Fellows M.R., and Hermelin D. On problems without polynomial kernels (extended abstract). ICALP (1). Lecture Notes in Computer Science vol. 5125 (2008) 563-574
5. 2)) steps. WG. Lecture Notes in Computer Science vol. 3353 (2004) 257-269
6. Nathann Cohen, Fedor Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo, Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem, Tech. Report arXiv:0903.0938, March, 2009
7. Alan Demers, Alan Downing, Minimum leaf spanning tree, US Patent no. 6,105,018, 2008
8. Downey R., and Fellows M. Parameterized Complexity (1999), Springer-Verlag
9. Fellows M., Heggernes P., Rosamond F.A., Sloper C., and Telle J.A. Finding k disjoint triangles in an arbitrary graph. WG. Lecture Notes in Computer Science vol. 3353 (2004) 235-244
10. Fernau H. Parameterized algorithmics for linear arrangement problems. Discrete Applied Mathematics 156 17 (2008) 3166-3177
11. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer-Verlag
12. Guo J., and Niedermeier R. Invitation to data reduction and problem kernelization. ACM SIGACT News 38 1 (2007) 31-45
13. Gutin G., Rafiey A., Szeider S., and Yeo A. The linear arrangement problem parameterized above guaranteed value. Theory of Computing Systems 41 3 (2007) 521-538
14. Gutin G., Szeider S., and Yeo A. Fixed-parameter complexity of minimum profile problems. Algorithmica 52 2 (2008) 133-152
15. Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger, Interval completion with few edges, in: STOC, 2007, pp. 374-381
16. Mahajan M., and Raman V. Parameterizing above guaranteed values: Maxsat and maxcut. Journal of Algorithms 31 2 (1999) 335-354
17. Niedermeier R. Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications vol. 31 (2006)
18. Prieto E., and Sloper C. Either/or: Using vertex cover structure in designing fpt-algorithms - the case of k-internal spanning tree. WADS. Lecture Notes in Computer Science vol. 2748 (2003) 474-483
19. Prieto E., and Sloper C. Reducing to independent set structure - the case of k-internal spanning tree. Nordic Journal of Computing 12 3 (2005) 308-318