Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 251-262

  Dorn, Frederic ^a   Fomin, Fedor V ^a   Lokshtanov, Daniel ^a   Raman, Venkatesh ^b   Saurabh, Saket ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Directed graphs; Internal out branching; Out branching; Parameterized subexponential algorithms

Indexed keywords

COMBINATORIAL STRUCTURES; DIRECTED HAMILTONIAN PATH PROBLEMS; INTERNAL OUT-BRANCHING; LAYERING TECHNIQUES; ORIENTED SPANNING TREES; OUT-BRANCHING; PARAMETERIZED ALGORITHM; SUB-EXPONENTIAL ALGORITHMS;

ALGORITHMS; COMPUTER SCIENCE; DIRECTED GRAPHS; PARALLEL ARCHITECTURES; PARAMETERIZATION;

PROBLEM SOLVING;

EID: 84880220409     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2459     Document Type: Conference Paper

References (30)

1. J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica, 33(4):461-493, 2002.
2. N. Alon, F. V. Fomin, G. Gutin, M. Krivelevich, and S. Saurabh. Spanning directed trees with many leaves. SIAM Journal on Discrete Mathematics, 23(1):466-476, 2009.
3. N. Alon, D. Lokshtanov, and S. Saurabh. Fast FAST. In ICALP 09, volume 5555 of LNCS, pages 49-58. Springer, 2009.
4. N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42(4):844-856, 1995.
5. B. S. Baker. Approximation algorithms for np-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
6. P. Bonsma and F. Dorn. Tight bounds and a fast FPT algorithm for directed max-leaf spanning tree. to appear in Transaction on Algorithms.
7. J. Chen, F. V. Fomin, Y. Liu, S. Lu, and Y. Villanger. Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci., 74(7):1188-1198, 2008.
8. J. Chen, I. A. Kanj, and G. Xia. Improved parameterized upper bounds for vertex cover. In MFCS 06, volume 4162 of LNCS, pages 238-249. Springer, 2006.
9. N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh, and A. Yeo. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. In COCOON, volume 5609 of LNCS, pages 37-46, 2009.
10. J. Daligault, G. Gutin, E. J. Kim, and A. Yeo. FPT algorithms and kernels for the directed k-leaf problem. CoRR, abs/0810.4946, 2008.
11. J. Daligault and S. Thomassé. On finding directed trees with many leaves. In IWPEC 09, LNCS, page to appear, Berlin, 2009. Springer-Verlag.
12. E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos. Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms, 1(1):33-47, 2005.
13. E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM, 52(6):866-893, 2005.
14. E. D. Demaine and M. Hajiaghayi. Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica, 28(1):19-36, 2008.
15. E. D. Demaine and M. T. Hajiaghayi. The bidimensionality theory and its algorithmic applications. Computer Journal, 51(3):292-302, 2008.
16. E. D. Demaine, M. T. Hajiaghayi, and K. Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In FOCS 05, pages 637-646, 2005.
17. F. Dorn, F. V. Fomin, and D. M. Thilikos. Catalan structures and dynamic programming in H-minor-free graphs. In SODA 08, pages 631-640. SIAM, 2008.
18. F. Dorn, F. V. Fomin, and D. M. Thilikos. Subexponential parameterized algorithms. Computer Science Review, 2(1):29-39, 2008.
19. F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin. Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. to appear in Algorithmica.
20. H. Fernau, F. V. Fomin, D. Lokshtanov, D. Raible, S. Saurabh, and Y. Villanger. Kernel(s) for problems with no kernel: On out-trees with many leaves. In STACS, pages 421-432, 2009.
21. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, Berlin, 2006.
22. F. V. Fomin, S. Gaspers, S. Saurabh, and S. Thomassé. A linear vertex kernel for maximum internal spanning tree. In ISAAC 09, page to appear. Springer, 2009.
23. F. V. Fomin and D. M. Thilikos. Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM J. Comput., 36:281-309, 2006.
24. G. Gutin, E. J. Kim, and I. Razgon. Minimum leaf out-branching problems. CoRR, abs/0801.1979, 2008.
25. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity. J. Comput. System Sci., 63(4):512-530, 2001.
26. J. Kneis, A. Langer, and P. Rossmanith. A new algorithm for finding trees with many leaves. In ISAAC 08, volume 5369 of LNCS, pages 270-281. Springer-Verlag, 2008.
27. R. Niedermeier. Invitation to fixed-parameter algorithms. Oxford University Press, Oxford, 2006.
28. E. Prieto and C. Sloper. Reducing to independent set structure - the case of k-internal spanning tree. Nord. J. Comput., 12(3):308-318, 2005.
29. B. A. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Oper. Res. Lett., 32(4):299-301, 2004.
30. N. Robertson, P. Seymour, and R. Thomas. Quickly excluding a planar graph. J. Comb. Th. Ser. B, 62:323-348, 1994.